Recaman's Sequence（poj2081）

题目：

Description

The Recaman's sequence is defined by a0 = 0 ; for m > 0, a _m = a _m−1 − m if the rsulting a _m is positive and not already in the sequence, otherwise a _m = a _m−1 + m. 
The first few numbers in the Recaman's Sequence is 0, 1, 3, 6, 2, 7, 13, 20, 12, 21, 11, 22, 10, 23, 9 ... 
Given k, your task is to calculate a _k.

Input

The input consists of several test cases. Each line of the input contains an integer k where 0 <= k <= 500000. 
The last line contains an integer −1, which should not be processed.

Output

For each k given in the input, print one line containing a _k to the output.

Sample Input

7
10000
-1

Sample Output

20
18658

水~~

以下是AC代码：

#include<iostream>
#include<string.h>
using namespace std;
int d[500000+20],ans,visit[5000000]={0};
int main()
{
    int n;
    memset(d,0,sizeof(d));
     memset(visit,-1,sizeof(visit));
     visit[0]=1;
    d[0]=0;

    for(int i=1;i<=500000;i++)
    {
        d[i]=d[i-1]-i;



        if(visit[d[i]]==1 || d[i]<0)
            d[i]=d[i-1]+i;

        visit[d[i]]=1;
    }
    cin>>n;
    while(n!=-1)
    {
        cout<<d[n]<<endl;

        cin>>n;
    }
    return 0;
}