Linux和MinGW（ZOJ）上hash_set和hash_map使用方案

/*
* PKU2081.cpp
*
*  Created on: 2011-3-19
*      Author: Administrator
*/

#include <stdio.h>
//#include <set>
#include <ext/hash_set>
using namespace std;
using namespace __gnu_cxx;

const int MAXK = 500000 + 1;

//set<int> s1;
hash_set<int> s1;
int a[MAXK];

int main () {
a[0] = 0;
s1.insert(a[0]);

for (int i = 1; i <= MAXK; i++) {
a[i] = a[i-1] - i;
if (a[i] > 0 && s1.find(a[i]) == s1.end())
;
else
a[i] = a[i-1] + i;

s1.insert(a[i]);
}

//    for (int i = 0; i < 20; i++)
//        printf("%d: %d\n", i, a[i]);
while (true) {
int n;
scanf("%d", &n);
if (n == -1)
break;

printf("%d\n", a
);
}

return 0;
}