凡人升天传1——树状数组格式

#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e5+5;
int a[MAXN],c[MAXN],n;
long long read(){//快读函数 
	long long ans=0,f=1;
	char ch=getchar();
	while(!isdigit(ch)){
		f*=(ch=='-')?-1:1;
		ch=getchar();
	}
	while(isdigit(ch)){
		ans=(ans<<3)+(ans<<1)+(ch^48);
		ch=getchar();
	}
	return ans*f;
}
int lowbit(int k){//返回2^k的值 
	return k&-k;
}
void change(int k,int val){//更改与k有关的c[i] 
	while(k<=n){
		c[k]+=val;
		k+=lowbit(k);
	}
}
int sum(int k){//求第k项的前缀和 
	int sum=0;
	while(k>0){
		sum+=c[k];
		k-=lowbit(k);	
	}
	return sum;
}
int main(){
	n=read();
	for(int i=1;i<=n;i++){
		a[i]=read();
		change(i,a[i]);
	}
	for(int i=1;i<=n;i++){
		printf("%d\n",sum(i));
	}
}