HDU 4727 水题

最新推荐文章于 2017-04-10 16:02:05 发布

Tczxw

最新推荐文章于 2017-04-10 16:02:05 发布

阅读量360

点赞数

本文链接：https://blog.csdn.net/Tczxw/article/details/51472460

版权

#include <cstdio>
#include <cstring>
const int maxn = 1E5 + 10;
int T, n, inp[maxn], kase;
int main(int argc, char const *argv[])
{
	scanf("%d", &T);
	while (T--)
	{
		scanf("%d", &n);
		for (int i = 0; i < n; i++)
			scanf("%d", &inp[i]);
		bool first = 0;
		for (int i = 1; i < n - 1; i++)
			if (inp[i] != inp[i + 1] - 1)
				first = 1;
		if (first == 0) printf("Case #%d: %d\n", ++kase, 1);
		else
		{
			for (int i = 1; i < n; i++)
				if (inp[i] != inp[0] + i)
				{
					printf("Case #%d: %d\n", ++kase, i + 1);
					break;
				}
		}
	}
	return 0;
}

水题一个，想清楚在写。