AOJ 801.热身之蘸酱吃

 1 #include <cstdio>
 2 #include <algorithm>
 3 #include <cstring>
 4 #include <cmath>
 5 #include <string>
 6 #include <iostream>
 7 #include <vector>
 8 #include <list>
 9 #include <stack>
10 using namespace std;
11  
12 #define REP(n) for(int o=0;o<n;o++)
13  
14 const int maxn = 1005;
15 int w[maxn];
16  
17 bool Do() {
18     int n,m,T;
19     if(scanf("%d%d%d",&n,&m,&T) == EOF)
20         return false;
21     REP(n)
22         scanf("%d",&w[o+1]);
23     REP(m) {
24         int l,r,k;
25         scanf("%d%d%d",&l,&r,&k);
26         for(;l <= r;l++)
27             w[l] += k;
28     }
29     REP(T) {
30         int L,R;
31         int ans=0;
32         scanf("%d%d",&L,&R);
33         for(;L <= R;L++)
34             ans += w[L];
35         printf("%d\n",ans);
36     }
37     return true;
38 }
39  
40 int main() {
41     while(Do());
42     return 0;
43 }