Codeforces Round 167 (Div. 2)
C
Dima and Staircase
Codeforces
1500
原题
← BD →
翻译中…

Dima's got a staircase that consists of $*n*$ stairs. The first stair is at height $*a*_{1}$, the second one is at $*a*_{2}$, the last one is at $*a*_{*n*}$ ($1 ≤ *a*_{1} ≤ *a*_{2} ≤ ... ≤ *a*_{*n*}$).

翻译中…

Dima decided to play with the staircase, so he is throwing rectangular boxes at the staircase from above. The $*i*$-th box has width $*w*_{*i*}$ and height $*h*_{*i*}$. Dima throws each box vertically down on the first $*w*_{*i*}$ stairs of the staircase, that is, the box covers stairs with numbers $1, 2, ..., *w*_{*i*}$. Each thrown box flies vertically down until at least one of the two following events happen:

翻译中…
  • the bottom of the box touches the top of a stair;
  • the bottom of the box touches the top of a box, thrown earlier.
翻译中…

We only consider touching of the horizontal sides of stairs and boxes, at that touching with the corners isn't taken into consideration. Specifically, that implies that a box with width $*w*_{*i*}$ cannot touch the stair number $*w*_{*i*} + 1$.

翻译中…

You are given the description of the staircase and the sequence in which Dima threw the boxes at it. For each box, determine how high the bottom of the box after landing will be. Consider a box to fall after the previous one lands.

翻译中…

Input

翻译中…

The first line contains integer $*n*$ $(1 ≤ *n* ≤ 10^{5})$ — the number of stairs in the staircase. The second line contains a non-decreasing sequence, consisting of $*n*$ integers, $*a*_{1}, *a*_{2}, ..., *a*_{*n*}$ $(1 ≤ *a*_{*i*} ≤ 10^{9}; *a*_{*i*} ≤ *a*_{*i* + 1})$.

翻译中…

The next line contains integer $*m*$ $(1 ≤ *m* ≤ 10^{5})$ — the number of boxes. Each of the following $*m*$ lines contains a pair of integers $*w*_{*i*}, *h*_{*i*}$ $(1 ≤ *w*_{*i*} ≤ *n*; 1 ≤ *h*_{*i*} ≤ 10^{9})$ — the size of the $*i*$-th thrown box.

翻译中…

The numbers in the lines are separated by spaces.

翻译中…

Output

翻译中…

Print $*m*$ integers — for each box the height, where the bottom of the box will be after landing. Print the answers for the boxes in the order, in which the boxes are given in the input.

翻译中…

Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier.

翻译中…

Note

翻译中…

The first sample are shown on the picture.

翻译中…

image

翻译中…

样例

Input #1
5
1 2 3 6 6
4
1 1
3 1
1 1
4 3
Output #1
1
3
4
6
InputCopy OutputCopy
Input #2
3
1 2 3
2
1 1
3 1
Output #2
1
3
InputCopy OutputCopy
Input #3
1
1
5
1 2
1 10
1 10
1 10
1 10
Output #3
1
3
13
23
33
InputCopy OutputCopy
题目信息
题号
272C
时间限制
2 s
内存限制
256 MB
标签
数据结构
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。