1062 序列中最大的数

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <iomanip>
using namespace std;
#define MAXN 100005
typedef long long LL;
LL a[MAXN],m[MAXN];
/*
a[0] = 0
a[1] = 1
a[2i] = a[i]
a[2i+1] = a[i] + a[i+1]
0 1 2 3 4 5 6 7 8 9 10
0 1 1 2 1 3 2 3 1 4 3
*/
void init()
{
    a[0] = m[0] = 0;
    a[1] = m[1] = 1; 
    LL M = 1;
    for(LL i=2;i<MAXN;i++)
    {
        if(i%2==0)
        {
            a[i] = a[i/2];
        }
        else
        {
            a[i] = a[i/2]+a[i/2+1];
        }
        M = max(M,a[i]);
        m[i] = M;
    }
}
int main()
{
    init();
    LL t,n;
    scanf("%lld",&t);
    while(t--)
    {
        scanf("%lld",&n);
        printf("%lld\n",m[n]);
    }
    return 0;
}