CF1814E.Chain Chips
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
You are given an undirected graph consisting of n vertices and n−1 edges. The i -th edge has weight ai ; it connects the vertices i and i+1 .
Initially, each vertex contains a chip. Each chip has an integer written on it; the integer written on the chip in the i -th vertex is i .
In one operation, you can choose a chip (if there are multiple chips in a single vertex, you may choose any one of them) and move it along one of the edges of the graph. The cost of this operation is equal to the weight of the edge.
The cost of the graph is the minimum cost of a sequence of such operations that meets the following condition:
- after all operations are performed, each vertex contains exactly one chip, and the integer on each chip is not equal to the index of the vertex where that chip is located.
You are given q queries of the form:
- k x — change the weight of the k -th edge (the one which connects the vertices k and k+1 ) to x .
After each query, print the cost of the graph. Note that you don't actually move any chips; when you compute the cost, the chips are on their initial positions.
输入格式
The first line contains one integer n ( 2≤n≤2⋅105 ).
The second line contains n−1 integers a1,a2,…,an−1 ( 1≤ai≤109 ).
The third line contains one integer q ( 1≤q≤2⋅105 ).
Then q lines follow. The i -th of them contains two integers k and x ( 1≤k≤n−1 ; 1≤x≤109 ) for the i -th query.
输出格式
For each query, print one integer — the cost of the graph after the query is performed.
输入输出样例
输入#1
10 12 6 12 15 20 8 17 12 15 8 4 10 7 3 6 14 9 9 2 10 3 5 4 11 7 11
输出#1
126 108 120 108 112 98 98 114