1338.cpp

来自「杭电 acm部分代码 有兴趣的可以下载 谢谢」· C++ 代码 · 共 37 行

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int hash[1001];
int main()
{
	int n, m, i, a, num, maxsum, ok, test = 0;
	while (cin >> n >> m)
	{
		if (n * m == 0)
		{
			break;
		}
		memset(hash, -1, sizeof(hash));
		num = n * m;
		while (m--)
		{
			cin >> a;
			hash[a] = 1;
		}
		getchar();
		getchar();
		ok = 0;
		maxsum = 0;
		for (i = num; i > 0; i--)
		{
			ok += hash[i];
			if (ok > maxsum)
			{
				maxsum = ok;
			}
		}
		cout << "Case " << ++test << ": " << maxsum << endl;
	}
	return 0;
}