poj2081 Recaman's Sequence(简单递推)
来源:互联网 发布:淘宝代销发货退货地址 编辑:程序博客网 时间:2024/06/05 02:14
poj2081
需要把标记数组开大开大开大!
#include<iostream>#include<algorithm>#include<cstdio>#include<cstdlib>#include<cstring>using namespace std;const int N=500005;bool temp[10*N];int a[N];int main(){ memset(temp,false,sizeof(temp)); memset(a,0,sizeof(a)); a[0]=0; temp[0]=true; for(int i=1;i<N;i++) { if(a[i-1]-i>0&&temp[a[i-1]-i]==false) { a[i]=a[i-1]-i; temp[a[i]]=true; } else { a[i]=a[i-1]+i; temp[a[i]]=true; } } int n; while(scanf("%d",&n)!=-1) { if(n==-1) break; else printf("%d\n",a[n]);; } return 0;}
0 0
- poj2081 Recaman's Sequence(简单递推)
- Recaman's Sequence(poj2081)
- POJ2081:Recaman's Sequence
- poj2081 Recaman's Sequence
- POJ2081 Recaman's Sequence
- poj2081 Recaman's Sequence
- POJ2081 2081 Recaman's Sequence
- 【poj2081】Recaman's Sequence (动态规划DP)
- 北大ACM poj2081 Recaman's Sequence
- POJ 2081 Recaman's Sequence (递推)
- zoj 2421 Recaman's Sequence(水~)
- POJ 2081 Recaman's Sequence(水题)
- POJ 2081 Recaman's Sequence(水~)
- Recaman's Sequence
- PKUOJ2081 Recaman's Sequence
- ZOJ2421 Recaman's Sequence
- Recaman's Sequence
- Recaman's Sequence
- PHP 读取/导出 CSV文件
- 快速排序(QuickSort)
- 事件分发机制
- Qt中的并发
- 模拟登陆CSDN——就是这么简单
- poj2081 Recaman's Sequence(简单递推)
- 解决本地Android帮助文档打开缓慢的问题
- Intellij IDEA菜单项中Compile、Make和Build的区别
- 最大子段和 (dp)
- 有关二叉树的计算
- 26. Remove Duplicates from Sorted Array
- ASP .NET MVC ORM 数据库优先
- 报头压缩-ROHC基本概念
- Oracle操作用户和表空间的总结