Problem Description
N Soldiers are lined up for a memory test. They are numbered from 0 to N-1 from left to right.
In the test, there are M rounds. In each round, Captain selects one position. Soldier at that position will be numbered 0. All the soldiers to the right of selected position will be numbered one greater than the soldier to his left. All the soldiers to the
left of selected position will be numbered one greater than the soldier to his right.
eg. if N = 6 and selected position is 3, then the numbering will be [3, 2, 1, 0, 1, 2].
After M rounds, Captain asked each soldier to shout out the greatest number he was assigned during the M rounds. In order to check the correctness, Captain asked you to produce the correct values for each soldier (That is the correct value each soldier should
shout out).
Input
The first line of the input contains an integer T denoting the number of test cases.
First line of each test case contains two integers, N and M.
Second line of each test case contains M integers, the positions selected by Captain, in that order.
Output
For each test case, output one line with N space separated integers.
Constraints
1 ≤ T ≤ 10^4
1 ≤ N ≤ 10^5
1 ≤ M ≤ 10^5
1 ≤ Sum of N over all testcases ≤ 10^5
1 ≤ Sum of M over all testcases ≤ 10^5
0 ≤ Positions selected by captain ≤ N-1
Example
Input
2
4 1
1
6 2
2 3
Output
1 0 1 2
3 2 1 1 2 3
题解
模拟即可。
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<cmath>
#include<algorithm>
#define inf 1<<30
#define eps -1
using namespace std;
int T,n,m,minw,maxw;
void init()
{
scanf("%d%d",&n,&m);
maxw=eps; minw=inf;
int i,x;
for(i=1;i<=m;i++)
{scanf("%d",&x);
maxw=max(maxw,x);
minw=min(minw,x);
}
}
void find()
{
int i;
for(i=0;i<n;i++)
{if(i<minw) printf("%d",maxw-i);
else if(i>maxw) printf("%d",i-minw);
else printf("%d",max(abs(maxw-i),abs(minw-i)));
if(i<n-1) printf(" ");
else printf("\n");
}
}
int main()
{
scanf("%d",&T);
while(T--)
{init(); find();}
return 0;
}