poj 2081 Recaman's Sequence
2013-08-05 10:26
260 查看
难道真就是这样暴力出来的,有什么神级解法么?我竟然连Am的范围都是自己随便猜的一个10000000就直接过了,有好解法的请联系我,求赐教。
#include<cstdio>
#include<cstring>
#include<iostream>
#define N 500001
using namespace std;
long long arr
;
bool vis[10000001];
void ini()
{
memset(vis,false,sizeof(vis));
arr[0] = 0;
vis[0] = true;
for(int i=1;i<N;++i)
{
long long x = arr[i-1] - i;
if(x>0&&!vis[x])
arr[i] = x;
else
arr[i] = arr[i-1] + i;
vis[arr[i]] = true;
}
}
int main(void)
{
int m;
ini();
while(cin>>m,m!=-1)
{
cout<<arr[m]<<endl;
}
return 0;
}
#include<cstdio>
#include<cstring>
#include<iostream>
#define N 500001
using namespace std;
long long arr
;
bool vis[10000001];
void ini()
{
memset(vis,false,sizeof(vis));
arr[0] = 0;
vis[0] = true;
for(int i=1;i<N;++i)
{
long long x = arr[i-1] - i;
if(x>0&&!vis[x])
arr[i] = x;
else
arr[i] = arr[i-1] + i;
vis[arr[i]] = true;
}
}
int main(void)
{
int m;
ini();
while(cin>>m,m!=-1)
{
cout<<arr[m]<<endl;
}
return 0;
}
相关文章推荐
- POJ-2081-Recaman's Sequence
- POJ 2081 Recaman's Sequence
- POJ 2081 Recaman's Sequence (递推)
- POJ 2081 Recaman's Sequence G++ 散列表的范围是博友求出来的
- poj 2081 Recaman's Sequence
- poj 2081【Recaman's Sequence】
- POJ-2081 Recaman's Sequence
- poj2081 Recaman's Sequence(简单递推)
- Poj 2081 Recaman's Sequence之解题报告
- POJ 2081 Recaman's Sequence 解题报告
- POJ-2081-Recaman's Sequence-Hash思想解题
- POJ 2081——Recaman's Sequence
- poj2081 Recaman's Sequence
- poj 2081 Recaman's Sequence【hash】
- POJ 2081 Recaman's Sequence
- POJ 2081 Recaman's Sequence
- POJ-2081:Recaman's Sequence
- POJ2081 Recaman's Sequence
- 2081 Recaman's Sequence 水题报告
- POJ 2081 Recaman's Sequence