| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 2 초 | 1024 MB | 58 | 46 | 45 | 83.333% |
Farmer John's $N$ $(1 \leq N \leq 5 \cdot 10^5)$ cows are lined up in a circle. The $i$th cow has a bucket with integer capacity $a_i$ $(1 \leq a_i \leq 10^9)$ liters. All buckets are initially full.
Every minute, cow $i$ will pass all the milk in their bucket to cow $i+1$ for 1ドル\le i<N,ドル with cow $N$ passing its milk to cow 1ドル$. All exchanges happen simultaneously (i.e., if a cow has a full bucket but gives away $x$ liters of milk and also receives $x$ liters, her milk is preserved). If a cow's total milk ever ends up exceeding $a_i,ドル then the excess milk will be lost.
After each of 1,ドル 2, \dots, N$ minutes, how much total milk is left among all cows?
The next line contains integers $a_1,a_2,...,a_N$.
6 2 2 2 1 2 1
8 7 6 6 6 6
Initially, the amount of milk in each bucket is $[2, 2, 2, 1, 2, 1]$.
8 3 8 6 4 8 3 8 1
25 20 17 14 12 10 8 8
After 1ドル$ minute, the amount of milk in each bucket is $[1, 3, 6, 4, 4, 3, 3, 1]$ so the total amount of milk is 25ドル$.
10 9 9 10 10 6 8 2 1000000000 1000000000 1000000000
2000000053 1000000054 56 49 42 35 28 24 20 20