第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-992 士兵杀敌(二)

#include<stdio.h>
int main()
{
	int pr=5;
	while(pr--)
	{
	int n,m;
	int shu[10001];
	scanf("%d%d",&n,&m);
	int i;
	for(i=0;i<n;i++)
	{
		scanf("%d",&shu[i]);
	}
	while(m--)
	{
		getchar();
		int sum=0;
		char x[10];
		int p,q;
		scanf("%s %d %d",x,&p,&q);
		if(x[0]=='Q')
		{
			for(;p<=q;p++)
				sum+=shu[p-1];
			printf("%d\n",sum);
		}
		else
		{
			shu[p-1]+=q;
		}
	}
	}
}

#include<stdio.h>
#include<string.h>
int p[1000010],n;
int lowbit(int x)
{
 return x&(-x);
}
void add(int i,int x)
{
 while(i<=n)
 {
  p[i]+=x;
  i+=lowbit(i);
 }
}
int sum(int x)
{
 int res=0;
 while(x>0)
 {
  res+=p[x];
  x-=lowbit(x);
 }
 return res;
}
int main()
{
 int m,i,x,a,b;
 char s[10];
 while(scanf("%d%d",&n,&m)!=EOF)
 {
  memset(p,0,sizeof(p));
  for(i=1;i<=n;i++)
  {
   scanf("%d",&x);
   add(i,x);
  }
  for(i=1;i<=m;i++)
  {
   scanf("%s",s);
   if(s[0]=='Q')
   {
    scanf("%d%d",&a,&b);
    int res=sum(b)-sum(a-1);
    printf("%d\n",res);
   }
   else
   {
    scanf("%d%d",&a,&x);
    add(a,x);
   }
  }
 }
 return 0;
} 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		StreamTokenizer x = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
		while(x.nextToken()!=x.TT_EOF) {
		int n=(int)x.nval;
		x.nextToken();
		int m=(int)x.nval;
		int aa[]=new int[n];
		for(int i=0;i<n;i++) {
			x.nextToken();
			aa[i]=(int)x.nval;
		}
		while(m--!=0) {
			x.nextToken();
			String s=x.sval;
			if(s.equals("QUERY")) {
				x.nextToken();
				int i=(int)x.nval-1,sum=0;
				x.nextToken();
				int j=(int)x.nval-1;
				for(;i<=j;i++)
					sum+=aa[i];
				System.out.println(sum);
			}
			else {
				x.nextToken();
				int i=(int)x.nval-1;
				x.nextToken();
				aa[i]+=(int)x.nval;
			}
		}
	}
	}
}

T = 5
while T > 0:
    T -= 1
    a = list(map(int, input().split()))
    b = list(map(int, input().split()))
    c = []
    for x in range(a[1]):
        d = list(input().split())
        if d[0] == 'QUERY':
            c.append(sum(b[int(d[1]) - 1:int(d[2])]))
        else:
            b[int(d[1]) - 1] += int(d[2])

    for x in range(len(c)):
        print(c[x])