URAL 1079 Maximum 递推

#include<iostream>
using namespace std;
int a[100000],f[100000];
int main(){
int i,ans=1;
a[0]=0;
a[1]=1;
f[0]=0;
f[1]=1;
for(i=2; i<=99999; i++)
{
if(i&1)
a[i]=a[i/2]+a[i/2+1];
else
a[i]=a[i/2];
ans=max(ans,a[i]);
f[i]=ans;
}
while(1){
int n;
cin>>n;
if(!n)break;
cout<<f
<<endl;
}
return 0;
}