//简单树状数组题
#include<stdio.h>
#include<string.h>
int n;
int c[50002];
void insert(int k,int dir)//改变第K项的值
{
while(k<n+1)
{
c[k]+=dir;
k+=k&(-k);//从C[k]往根节点一路上溯
}
}
int sum(int k)
{
int sm=0;
while(k>0)
{
sm=sm+c[k];
k-=k&(-k);//从C[k]往根节点一路下溯
}
return sm;
}
int main()
{
int i,y,t,m,k,x,j=1;
char str[50002],ch;
scanf("%d",&t);
while(t--)
......
阅读全文