POJ 2081 Recaman's Sequence 解题报告

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

/**
 题目大意：如果am−1 − m为正数，且未在序列中出现则am = am−1 − m，否则am = am−1 + m
*/

#include<iostream>
#include<cstdio>

using namespace std;

#define N 500000

long a[N + 5] = {0};
bool flag[10*N] = {true, false};

int main()
{
	int i;
	for(i = 1; i <= N; i++) {
		if(a[i-1] - i > 0 && !flag[a[i-1] - i]) {
			a[i] = a[i-1] - i;
			flag[a[i-1] - i] = true;
		} else {
			a[i] = a[i-1] + i;
			flag[a[i-1] + i] = true;
		}
	}
	int n;
	while(scanf("%ld", &n) && n != -1) {
		printf("%d\n", a[n]);
	}
	return 0;
}