The Number Off of FFF
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 34 Accepted Submission(s): 19
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.
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 <= 10 5)
It guaranteed that there is exactly one soldier who has made the mistake.
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 <= 10 5)
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
Source
Recommend
zhuyuanchen520
有反向的情况,这里要注意判断
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <string.h>
using namespace std;
int pri[100050];
int main()
{
int tcase,t=1,n,i,k;
scanf("%d",&tcase);
while(tcase--)
{
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&pri[i]);
}
printf("Case #%d: ",t++);
bool flag=true;int ans,mist;
mist=1;
for(i=2;i<=n;i++)
{
if(pri[i]-pri[i-1]!=1)
mist++;
if(mist>=2)
break;
}
if(mist==1)
{
printf("1
");
continue;
}
mist=0;
for(i=2;i<=n;i++)
{
if(pri[i]-pri[i-1]!=1)
mist++,ans=i;
if(mist>=2)
break;
}
if(mist==1)
{
printf("%d
",ans);
continue;
}
mist=1;
for(i=2;i<=n;i++)
{
if(pri[i]-pri[i-1]!=-1)
mist++;
if(mist>=2)
break;
}
if(mist==1)
{
printf("1
");
continue;
}
mist=0;
for(i=2;i<=n;i++)
{
if(pri[i]-pri[i-1]!=-1)
mist++,ans=i;
if(mist>=2)
break;
}
if(mist==1)
{
printf("%d
",ans);
continue;
}
}
return 0;
}