摘要：数据结构实验之排序四：寻找大富翁 Code: 1 #include <bits/stdc++.h> 2 using namespace std; 3 const int maxn = 1010; 4 const int minn = -10001; 5 6 int a[25]; 7 int n,m; 阅读全文

摘要：堆中的路径 AC_Code: 1 #include <bits/stdc++.h> 2 using namespace std; 3 const int maxn = 1010; 4 const int minn = -10001; 5 6 int Heap[maxn]; 7 int _size; 阅读全文