POJ 2081 Recaman's Sequence G++ 散列表的范围是博友求出来的

#include <iostream>#include <vector>//谢谢博友文章 3012501这个数是博友求出来的 using namespace std;int a[500001];int hash[3012501];int main(){a[0]=0;hash[0]=1;//int max=0;for(int i=1;i<500001;i++){if(a[i-1]>i){if(hash[a[i-1]-i]==0){a[i]=a[i-1]-i;hash[a[i-1]-i]=1;}else{a[i]=a[i-1]+i;hash[a[i-1]+i]=1; }}else{a[i]=a[i-1]+i;hash[a[i-1]+i]=1;}/*if(a[i]>max){max=a[i];}*/}//cout<<max<<endl;//3012500//cout<<a[500000]<<endl;//626684vector<int> jg;while(1){int t;cin>>t;if(t==-1){break;}jg.push_back(a[t]);}for(int i=0;i<jg.size();i++){cout<<jg[i]<<endl;}return 0;}