2178: GJJ來簽到
Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 535 Solved: 108
SubmitStatusWeb Board
Description
Input
Output
Sample Input
Sample Output
HINT
#include<cstdio>
#include<algorithm>
using namespace std;
#define Max 105
int a[Max],b[Max],sum[Max];
int main()
{
int T,N,M,i,j,num,temp,mmax;
while(scanf("%d",&T)!=EOF)
{
while(T--)
{
a[0]=0;
scanf("%d%d",&N,&M);
for(i=1;i<=N;i++)
scanf("%d",&a[i]);
a[i]=101;
int s=a[M+1]-1;
for(i=2;i<=N+1;i++)
{
if(i+M<=N+1) s=max(s,a[i+M]-a[i-1]-1);
}
printf("%d\n",(N==0||M>=N)?100:s);
}
}
return 0;
}