pku2081----Recaman's Sequence(按所给的递推公式来做就行)
2009-01-08 00:26
477 查看
5196K | 16MS | G++ | 414B |
后来发现他给的空间和时间限制,应该是足够的,就试了一下,结果就是上面这样子。
题目思路就是:首先生成结果
主程序里直接调用就可以了。
代码如下:
Code
#include<stdio.h>
#include<string.h>
int a[500005];
bool f[3012505];
void init()
{
int i;
memset(f,0,sizeof(f));
a[0] = 0;
for(i=1;i<=500000;i++){
if(a[i-1]-i > 0 && ! f[a[i-1]-i]){
a[i]=a[i-1]-i;
f[a[i-1]-i] = 1;
}
else{
a[i]=a[i-1]+i;
f[a[i-1]+i]=1;
}
}
}
int main()
{
int k;
init();
while(scanf("%d",&k),k!=-1){
printf("%d\n",a[k]);
}
return 0;
}
相关文章推荐
- POJ 2081 Recaman's Sequence
- poj 2081【Recaman's Sequence】
- poj 2081 Recaman's Sequence
- poj 2081 Recaman's Sequence【hash】
- POJ-2081-Recaman's Sequence-Hash思想解题
- Pku acm 2081 Recaman's Sequence 动态规划题目解题报告(三)
- POJ 2081 Recaman's Sequence G++ 散列表的范围是博友求出来的
- POJ 2081 Recaman's Sequence
- poj 2081 Recaman's Sequence
- 2081 Recaman's Sequence 水题报告
- poj2081 Recaman's Sequence(简单递推)
- POJ 2081 Recaman's Sequence
- Poj 2081 Recaman's Sequence之解题报告
- POJ 2081 Recaman's Sequence (递推)
- POJ 2081——Recaman's Sequence
- POJ-2081 Recaman's Sequence
- POJ 2081 Recaman's Sequence 解题报告
- POJ-2081-Recaman's Sequence
- poj2081 Recaman's Sequence
- pku 1699 Best Sequence 状态压缩dp