题目描述
According to the legend of Wizardry and Witchcraft, gnomes live in burrows underground, known as gnome holes. There they dig
up and eat the roots of plants, creating little heaps of earth around gardens, causing considerable damage to them.
Mrs. W, very annoyed by the damage, has to regularly de-gnome her garden by throwing the gnomes over the fence. It is a lot of work to throw them one by one because there are so many. Fortunately, the species is so devoted to their kings that each group always follows its king no matter what. In other words, if she were to throw just the king over the fence, all the other gnomes in that group would leave.
So how does Mrs. W identify the king in a group of gnomes? She knows that gnomes travel in a certain order, and the king, being special, is always the only gnome who does not follow that order.
Here are some helpful tips about gnome groups:
• There is exactly one king in a group.
• Except for the king, gnomes arrange themselves in strictly increasing ID order.
• The king is always the only gnome out of that order.
• The king is never the first nor the last in the group, because kings like to hide themselves.
Help Mrs. W by finding all the kings!
输入
The input starts with an integer n, where 1 ≤ n ≤ 100, representing the number of gnome groups. Each of the n following lines contains one group of gnomes, starting with an integer g, where 3 ≤ g ≤ 1 000,representing the number of gnomes in that group. Following on the same line are g space-separated integers, representing the gnome ordering. Within each group all the integers (including the king) are unique and in the range [0, 10 000]. Excluding the king, each integer is exactly one more than the integer preceding it.
输出
For each group, output the king’s position in the group (where the first gnome in line is number one).
样例输入
复制样例数据
3 7 1 2 3 4 8 5 6 5 3 4 5 2 6 4 10 20 11 12
样例输出
5 4 2
这两天又考驾照又是大创，终于是弄完了，现在开始好好补题。
这个题就是让找数列中不和谐的数字，就是把它扔了，数列就是严格递增的了。也没什么难的，具体实现看代码吧。
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e3+10;
int x[maxn];
int main()
{
#ifndef ONLINE_JUDGE
freopen("in","r",stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
while(n--)
{
int g,y;
cin >> g;
for(int i = 1;i <= g; i++)
cin >> x[i];
for(int i = 2;i < g; i++)
{
if((x[i] > x[i + 1] && x[i + 1] > x[i - 1]) || x[i] < x[i - 1])
{
cout << i <</* " " << x[i] << */endl;
break;
}
}
}
return 0;
}
