2014-10-30 13:53:38
A：话不多，模拟。
1 /************************************************************************* 2 > File Name: a.cpp 3 > Author: Nature 4 > Mail: 564374850@qq.com 5 > Created Time: Wed 29 Oct 2014 11:05:04 PM CST 6 ************************************************************************/ 7 8 #include <cstdio> 9 #include <cstring> 10 #include <cstdlib> 11 #include <cmath> 12 #include <vector> 13 #include <map> 14 #include <set> 15 #include <stack> 16 #include <queue> 17 #include <iostream> 18 #include <algorithm> 19 using namespace std; 20 #define lp (p << 1) 21 #define rp (p << 1|1) 22 #define getmid(l,r) (l + (r - l) / 2) 23 #define MP(a,b) make_pair(a,b) 24 typedef long long ll; 25 const int INF = 1 << 30; 26 27 int n,m; 28 int a[105]; 29 30 int main(){ 31 int x,y; 32 scanf("%d",&n); 33 for(int i = 1; i <= n; ++i) 34 scanf("%d",&a[i]); 35 scanf("%d",&m); 36 for(int i = 1; i <= m; ++i){ 37 scanf("%d%d",&x,&y); 38 if(x > 0) a[x - 1] += y - 1; 39 if(x < n) a[x + 1] += a[x] - y; 40 a[x] = 0; 41 } 42 for(int i = 1; i <= n; ++i) 43 printf("%d\n",a[i]); 44 return 0; 45 }