HDU 4727 he Number Off of FFF
来源:互联网 发布:java 购物车删除 编辑:程序博客网 时间:2024/05/29 08:33
he Number Off of FFF
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3740 Accepted Submission(s): 1242
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 <= 105)
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 <= 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
231 2 431001 1002 1004
Sample Output
Case #1: 3Case #2: 3
Source
2013 ACM/ICPC Asia Regional Online —— Warmup2
//只要找出序列中与钱一个人的数字差不是1的人即可,要注意的是这些人是从一个队列中间截取下来的,所以很有可能第一个人就报错了
#include <iostream>using namespace std;const int maxn = 100005;int vis[maxn];int main(){ int t; cin>>t; int num = 0; while(t--) { cout<<"Case #"<<++num<<": "; int n; cin>>n; for(int i=0;i<n;i++) { cin>>vis[i]; } int flag = 0; for(int i=1;i<n;i++) { if(vis[i] - vis[i-1] != 1) flag = i+1;; } if(!flag) { flag = 1; cout<<flag<<endl; } else cout<<flag<<endl; } return 0;}
0 0
- HDU 4727 he Number Off of FFF
- hdu 4727 The Number Off of FFF
- Hdu 4727 The Number Off of FFF
- HDU 4727 The Number Off of FFF
- HDU 4727 The Number Off of FFF
- HDU 4727 The Number Off of FFF
- HDU 4727 The Number Off of FFF
- HDU 4727 The Number Off of FFF
- HDU 4727-The Number Off of FFF
- HDU 4727 The Number Off of FFF
- HDU 4727 The Number Off of FFF
- HDU 4727 The Number Off of FFF (水题)
- HDU 4727 The Number Off of FFF 解题报告
- hdu 4727 The Number Off of FFF(遍历)
- hdu 4727 The Number Off of FFF(模拟)
- HDU 4727 The Number Off of FFF(水题)
- 【HDU 4727 】【水题】The Number Off of FFF
- HDU 4727 The Number Off of FFF (水)
- TF-IDF及其算法
- 使div或图标一直固定在屏幕的某个位置
- 热力图制作过程与心得
- 使用Angular2及WebApi开发SPA类型的企业应用
- 什么是android SDK和API
- HDU 4727 he Number Off of FFF
- shell--trap
- OkHttp基本使用(五)拦截器
- itext生成pdf
- 解决加载图片时OOM异常的一种方法
- 获取Kernel32的shellcode
- 深入剖析Android音频之AudioTrack
- Android 开源框架汇总
- jdk时区与电脑系统时区不一致,导致时间new date不对