傳送門:https://acm.zzuli.edu.cn/zzuliacm/problem.php?id=2178
2178: GJJ來簽到
Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 589 Solved: 127
SubmitStatusWeb Board
Description
Input
Output
Sample Input
Sample Output
HINT
Source
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
bool cmp(int a,int b)
{
return a>b;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n,m,a[150],b[150];
scanf("%d%d",&n,&m);
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
int j=0;
for(int i=m; i<n+m; i++)
{
scanf("%d",&a[i]);
b[j++]=a[i]-a[i-m-1]-1;
}
b[j++]=100-a[n-1];
sort(b,b+n+5,cmp);
printf("%d\n",b[0]);
}
return 0;
}