zoj3279 Ants

最最基本的树状数组+二分。。。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>

#define N 120000

using namespace std;

typedef struct xxx
{
    int x,y;
}ty;
ty a[N+100];
int c[N+100],n,k;

int lowbit(int x)
{
    return x&(-x);
}
void add(int i,int d)
{
    while(i<=N)
    {

        c[i]+=d;
        i+=lowbit(i);
    }
}
int sum(int i)
{
    if(i==0)return 0;
    int temp=0;
    while(i>0)
    {
        temp+=c[i];
        i-=lowbit(i);
    }
    return temp;
}
int main()
{
    int x,y,z,t1,t2,mid;
    char ope;
    while(scanf("%d",&n)!=EOF)
    {
        memset(c,0,sizeof(c));
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&x);
            add(i,x);
        }
        scanf("%d",&k);
        for(int i=1;i<=k;i++)
        {
            scanf(" %c",&ope);
            if(ope=='p'){scanf("%d%d",&x,&y);add(x,y-sum(x)+sum(x-1));}
            else
            {
                scanf("%d",&z);
                x=1;y=n;
                while(x<y)
                {
                    mid=(x+y)/2;
                    if(sum(mid)>=z)y=mid;
                    else                        x=mid+1;
                }
                printf("%d\n",x);
            }
        }
    }
    return 0;
}