C. Balls and Boxes

https://codeforces.com/problemset/problem/260/C

time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output

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 5 and 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 a 1, a 2, …, a n, where integer a i (0 ≤ a i ≤ 109, a x ≠ 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 %I64d specifier.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.ExamplesinputCopy

4 4
4 3 1 6

outputCopy

3 2 5 4 

inputCopy

5 2
3 2 0 2 7

outputCopy

2 1 4 1 6 

inputCopy

3 3
2 3 1

outputCopy

1 2 3 

---

题意： 有n个盒子（1-n排好） 盒子里有若干球，任意选择一个盒子i（这个盒子里保证有球），将球取出，一个一个放入i+1， i+2 … 盒子中，直到取出的球都放完(如果放了第n个盒子， 接下来从1号盒子开始放)

现在告诉你放完后各个盒子里球的数量 和 最后一个球放入的盒子的下标x， 问你放之前每个盒子里分别有多少球

---

思路：如果发现了最后的序列中数量最少的那个下标，那么那个下标就是给其他点球的下标。那么我们就可以从后开始模拟，把多加上去的减去，同时把多余一个轮回的先加回来发球的，然后再加一个轮回

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=2e5;
typedef long long LL;
LL a[maxn];
//逆向模拟 
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n,x;cin>>n>>x;
  LL m=0x3f3f3f3f;
  for(LL i=1;i<=n;i++) 
  {
  	cin>>a[i];m=min(m,a[i]);
  }
  LL sum=0;
  while(a[x]!=m)
  {
  		a[x]--;
  		sum++;
  		x--;
  		if(x==0) x=n;
  }
  for(LL i=1;i<=n;i++)
  {
  	if(i!=x) cout<<a[i]-m<<" ";//这里的x是最开始拿盒子的index 
  	else cout<<sum+n*m<<" ";
  }
  cout<<endl;
return 0;
}