C. Balls and Boxes
time limit per test：1 second memory limit per test：256 megabytes
Little Vasya had n boxes with balls in the room. The boxes stood in a row and were numbered with numbers from 1 to n from left to right.
Once Vasya chose one of the boxes, let's assume that its number is i, took all balls out from it (it is guaranteed that this box originally had at least one ball), and began putting balls (one at a time) to the boxes with numbers i + 1, i + 2, i + 3 and so on. If Vasya puts a ball into the box number n, then the next ball goes to box 1, the next one goes to box 2 and so on. He did it until he had no balls left in his hands. It is possible that Vasya puts multiple balls to the same box, and it is also possible that one or more balls will go to the box number i. If i = n, Vasya puts the first ball into the box number 1, then the next ball goes to box 2 and so on.
For example, let's suppose that initially Vasya had four boxes, and the first box had 3 balls, the second one had 2, the third one had 5and the fourth one had 4 balls. Then, if i = 3, then Vasya will take all five balls out of the third box and put them in the boxes with numbers: 4, 1, 2, 3, 4. After all Vasya's actions the balls will lie in the boxes as follows: in the first box there are 4 balls, 3 in the second one, 1 in the third one and 6 in the fourth one.
At this point Vasya has completely forgotten the original arrangement of the balls in the boxes, but he knows how they are arranged now, and the number x — the number of the box, where he put the last of the taken out balls.
He asks you to help to find the initial arrangement of the balls in the boxes.
Input
The first line of the input contains two integers n and x (2 ≤ n ≤ 105, 1 ≤ x ≤ n), that represent the number of the boxes and the index of the box that got the last ball from Vasya, correspondingly. The second line contains n space-separated integers a1, a2, ..., an, where integer ai (0 ≤ ai ≤ 109, ax ≠ 0) represents the number of balls in the box with index i after Vasya completes all the actions.
Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64dspecifier.
Output
Print n integers, where the i-th one represents the number of balls in the box number i before Vasya starts acting. Separate the numbers in the output by spaces. If there are multiple correct solutions, you are allowed to print any of them.
Examples
input 4 4 4 3 1 6 output 3 2 5 4 input 5 2 3 2 0 2 7 output 2 1 4 1 6 input 3 3 2 3 1 output 1 2 3
题意：有n个盒子，任意选一个盒子i把其中所有的球都拿出来依次分给接下来的盒子，下标递增，超过n则从1开始。给你最终每个盒子中球的个数情况和最后一个操作的盒子。问你原始的盒子情况是怎么样的。
解法：模拟。当然不能是朴素的模拟，那样会TLE。
首先考虑到最少球的盒子一定是被瓜分的盒子，因为它的球都被分给别的盒子了。
但是考虑到可能最少球的盒子不止一个。
这个时候就需要从最后操作的盒子x反向找回去找到的最少的球的盒子就是初始的盒子。
同时在这个过程中，就完成对这些盒子的-1操作。
找到被瓜分的盒子以后，遍历输出即可。
其他盒子减去被瓜分盒子的球的个数，被瓜分的加上之前遍历时减去的和其个数乘以盒子数量。
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int maxn = 2e5 + 10;
ll a[maxn];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int x, n;
cin >> n >> x;
x--;
ll mmin = 0xffffffff;
for(int i = 0; i < n; i++)
{
cin >> a[i];
mmin = min(mmin, a[i]);
}
int loc = x, time = 0;
for(;a[loc] != mmin;loc = (--loc) < 0 ? n - 1 : loc)
{
time++;
a[loc]--;
}
for(int i = 0; i < n; i++)
{
if(i == loc)
cout << time + mmin * n << ' ' ;
else cout << a[i] - mmin << ' ';
}
cout << endl;
return 0;
}