CF 272C Dima and Staircase（水题）

这道题只要好好分析，就很简单

代码如下：//C
//by Molly
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long ll;
int N = 100010;
ll n, m, p;

int main()
{
while ( scanf("%d", &n) != EOF ) {
ll ma
;
for ( int i = 1; i <= n; ++i ) scanf("%lld", &ma[i]);
scanf("%lld", &m);
p = 1;
for ( int i = 1; i <= m; ++i ) {
ll w, h;
scanf("%lld%lld", &w, &h);
p = max(p, ma[w]);
printf("%I64d\n",p);
p += h;
}
}
}