摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1280hash+最大堆，STL堆View Code #include <iostream>#include <map>#include <vector>#include <queue>#include <cstring>using namespace std;int hash[10001];int main(){ int n,m; priority_queue <int> q; while(~scanf("%d%d", 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1029看题意就是建立一个映射，用map直接过View Code #include <iostream>#include <map>using namespace std;int main(){ int n; while(~scanf("%d",&n)) { map <int ,int > M; int bz=(n+1)/2; while(n--) { int a; scanf("%d",&a)... 阅读全文