1323.cpp

http://www.cppblog.com/aclayton 流牛木马原创解题报告集２

#include"stdio.h"

int a[51];
int i,j,m,n,max,now,cas=0;

bool have(int x)
{
	for(j=1;j<=n;j++)
		if(x==a[j])return true;
	return false;

}

void main()
{

	while(1)
	{
		cas++;
	scanf("%d%d",&m,&n);
	if(m==0&&n==0)return;
    for(i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
	}
	max=0;now=0;
	for(i=n*m;i>=1;i--)
	{
		
		if(have(i)){now++;if(now>max)max=now;}
		else now--;

	}

	printf("Case %d: %d\n",cas,max);

	}
}