子集和问题,为甚我没见过。。。
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
#define rep(i,l,r) for(int i=(l),_=(r);i<=_;i++)
#define per(i,r,l) for(int i=(r),_=(l);i>=_;i--)
#define MS(arr,x) memset(arr,x,sizeof(arr))
#define INE(i,u) for(int i=head[u];~i;i=e[i].next)
#define LL long long
inline const int read()
{int r=0,k=1;char c=getchar();for(;c<'0'||c>'9';c=getchar())if(c=='-')k=-1;
for(;c>='0'&&c<='9';c=getchar())r=r*10+c-'0';return k*r;}
const int N=1111111;
int n,a[N];
void cal(int l,int r)
{
if(l==r) return;
int mid=l+r>>1;
cal(l,mid); cal(mid+1,r);
int len=mid-l+1;
rep(i,mid+1,r) a[i]+=a[i-len];
}
void input()
{
rep(i,1,n=read()) a[i]=read();
}
void solve()
{
cal(1,n);
rep(i,1,n) printf("%d\n",a[i]);
}
int main()
{
freopen("array.in","r",stdin); freopen("array.out","w",stdout);
input(),solve();
return 0;
}