1、经典数据结构与算法 线性表 队列 堆栈 排序 查找 二叉树线性表 案例 1Recaman问题Recamans Sequence Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB Problem 10010 : No special judgement Problem description The Recamans sequence is defined by a0 = 0 ; for m 0, am = am1 m if the rsulting am is positive and not already
2、 in the sequence, otherwise am = am1 + m. The first few numbers in the Recamans Sequence is 0, 1, 3, 6, 2, 7, 13, 20, 12, 21, 11, 22, 10, 23, 9 . Given k, your task is to calculate ak.Input The input consists of several test cases. Each line of the input contains an integer k where 0 = k = 500000. T
3、he last line contains an integer 1, which should not be processed.Output For each k given in the input, print one line containing ak to the output.Sample Input 7 10000 -1Sample Output 20 18658解题思路定义两个线性表：一个记录 ai的值 ,一个记录某个值是否已经被占用。核心代码及解释 int a500001,b3020000; /a数组如题目描述， b数组是 Bool数组，只有 0/1值， 0表示没占 /用， 1表示已经被占用 int main() a0=0; b=0； for(i=1;i500001;i+) ai=ai-1-i; if(ai=0|bai=1) ai=ai-1+i; bai=1; /标记是否使用 while(scanf(“%d“, return 0;
