hdu1166 敌兵布阵

#include <iostream>
#include<string>
using namespace std;
int Camp[50000];
int data[1000000];
int main()
{
    int T,i,j,n,sum,t = 1,comt;
    cin>>T;
    string Com;
    while(T--)
    {
        memset(Camp,0,sizeof(Camp));
        memset(data,0,sizeof(data));
        cin>>n;
        for(i = 0; i < n; i++)cin>>Camp[i];
        
        comt = 0;
        while(cin>>Com,Com!="End")
        {
            sum = 0;
            if(Com == "Query")
            {
                cin>>i>>j;
                
                while(i <= j)
                {
                    sum+=Camp[i-1];
                    i++;
                }
                data[comt] = sum;
                comt++;
            }
            if(Com == "Add")
            {
                cin>>i>>j;
                Camp[i-1] = Camp[i-1] + j;
            }
            if(Com == "Sub")
            {
                cin>>i>>j;
                /*if(j >= Camp[i-1])
                    Camp[i-1] = 0;
                else*/
                Camp[i-1] = Camp[i-1] - j;
            }
        }
        cout<<"Case "<<t<<":"<<endl;
        for(i = 0; i < comt; i++)
        {
            cout<<data[i]<<endl;
        }
        t++;
    }
    return 0;
}