HDU 4727 The Number Off of FFF

Problem Description

X soldiers from the famous "*FFF* army" is standing in a line, from left to right.
You, as the captain of *FFF*, decides to have a "number off", that is, each soldier, from left to right, calls out a number. The first soldier should call "One", each other soldier should call the number next to the number called out by the soldier on his left side. If every soldier has done it right, they will call out the numbers from 1 to X, one by one, from left to right.
Now we have a continuous part from the original line. There are N soldiers in the part. So in another word, we have the soldiers whose id are between A and A+N-1 (1 <= A <= A+N-1 <= X). However, we don't know the exactly value of A, but we are sure the soldiers stands continuously in the original line, from left to right.
We are sure among those N soldiers, exactly one soldier has made a mistake. Your task is to find that soldier.

 

Input

The rst line has a number T (T <= 10) , indicating the number of test cases.
For each test case there are two lines. First line has the number N, and the second line has N numbers, as described above. (3 <= N <= 105)
It guaranteed that there is exactly one soldier who has made the mistake.

 

Output

For test case X, output in the form of "Case #X: L", L here means the position of soldier among the N soldiers counted from left to right based on 1.

 

Sample Input

2 3 1 2 4 3 1001 1002 1004

 

Sample Output

Case #1: 3 Case #2: 3

 思路：有可能是第一个数就不不符合要求，因此先将答案初始化为1，然后遍历数组，找不符合要求的数，如果没找到就证明是第一个数直接输出即可

AC代码

#include<cstdio>
#include<iostream>
using namespace std;

const int N=100010;

int a[N];

int main()
{
	int t;
	cin>>t;
	for(int k=1;k<=t;k++)
	{
		int n;
		scanf("%d",&n);
		int res=1;
		for(int i=1;i<=n;i++)
			scanf("%d",&a[i]);
		
		for(int i=2;i<=n;i++)
			if(a[i]-a[i-1]!=1)
		{
			res=i;
			break;
		}
		printf("Case #%d: %d\n",k,res);
	}
}