Submission #14234689

---

Source Code Expand

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<iostream>
#include<set>
#include<map>
using namespace std;
#define mp make_pair
#define ll long long
#define re register
typedef pair<int,int> pii;
#define file(a) freopen(a".in","r",stdin);freopen(a".out","w",stdout)
inline ll gi()
{
	ll f=1,sum=0;char ch=getchar();
	while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){sum=(sum<<3)+(sum<<1)+ch-'0';ch=getchar();}
	return f*sum;
}
const int N=200010;
int n=gi(),k=gi();
int A[N],ret[N];
bool check()
{
	for(int i=1;i<=n;i++)if(A[i]!=n)return true;
	return false;
}
int main()
{
	for(int i=1;i<=n;i++)A[i]=gi();
	while(k--&&check())
	{
		for(int i=1;i<=n;i++)
		{
			ret[i]=1;
			for(int j=1;j<=n;j++)
				if(i!=j)if((i<j&&j-A[j]<=i)||(i>j&&j+A[j]>=i))ret[i]++;
		}
		for(int i=1;i<=n;i++)A[i]=ret[i];
	}
	for(int i=1;i<=n;i++)printf("%d%c",A[i]," \n"[i==n]);	
	return 0;
}

Submission Info

Judge Result