【CodeForces】Codeforces Round #677 (Div. 3) C. Dominant Piranha （思维）

C. Dominant Piranha
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
There are n piranhas with sizes a1,a2,…,an in the aquarium. Piranhas are numbered from left to right in order they live in the aquarium.

Scientists of the Berland State University want to find if there is dominant piranha in the aquarium. The piranha is called dominant if it can eat all the other piranhas in the aquarium (except itself, of course). Other piranhas will do nothing while the dominant piranha will eat them.

Because the aquarium is pretty narrow and long, the piranha can eat only one of the adjacent piranhas during one move. Piranha can do as many moves as it needs (or as it can). More precisely:

The piranha i can eat the piranha i−1 if the piranha i−1 exists and ai−1 The piranha i can eat the piranha i+1 if the piranha i+1 exists and ai+1 When the piranha i eats some piranha, its size increases by one (ai becomes ai+1).

Your task is to find any dominant piranha in the aquarium or determine if there are no such piranhas.

Note that you have to find any (exactly one) dominant piranha, you don’t have to find all of them.

For example, if a=[5,3,4,4,5], then the third piranha can be dominant. Consider the sequence of its moves:

The piranha eats the second piranha and a becomes [5,5–,4,5] (the underlined piranha is our candidate).
The piranha eats the third piranha and a becomes [5,6–,5].
The piranha eats the first piranha and a becomes [7–,5].
The piranha eats the second piranha and a becomes [8–].
You have to answer t independent test cases.

Input
The first line of the input contains one integer t (1≤t≤2⋅104) — the number of test cases. Then t test cases follow.

The first line of the test case contains one integer n (2≤n≤3⋅105) — the number of piranhas in the aquarium. The second line of the test case contains n integers a1,a2,…,an (1≤ai≤109), where ai is the size of the i-th piranha.

It is guaranteed that the sum of n does not exceed 3⋅105 (∑n≤3⋅105).

Output
For each test case, print the answer: -1 if there are no dominant piranhas in the aquarium or index of any dominant piranha otherwise. If there are several answers, you can print any.

Example

input

6
5
5 3 4 4 5
3
1 1 1
5
4 4 3 4 4
5
5 5 4 3 2
3
1 1 2
5
5 4 3 5 5

output

3
-1
4
3
3
1

Note
The first test case of the example is described in the problem statement.

In the second test case of the example, there are no dominant piranhas in the aquarium.

In the third test case of the example, the fourth piranha can firstly eat the piranha to the left and the aquarium becomes [4,4,5,4], then it can eat any other piranha in the aquarium.

---

题意：

类似于大鱼吃小鱼，每条鱼只能吃与他相邻，且比他小的鱼。当他吃了一个鱼后，他的大小+1。选择一条鱼可以吃掉其他所有鱼(答案不唯一，输出一个即可)

---

思路：

找到最大的鱼所在位置(可能有多个)，假如相邻处有比它小的(此时他吃完后，就是最大条的鱼)，那么他必定可以吃掉所有鱼

---

代码：

#include
using namespace std;
typedef long long ll;
const int maxn=2e5+50;
int t,n,x;
int main()
{
     	   
	cin>>t;
	while(t--)
	{
     
		cin>>n;
		map<int,vector<int>> mp; //记录大小为某值的所有鱼的位置
		vector<int> v;
		int maxnum=-1; //记录最大的体积
		for(int i=0;i<n;i++)
		{
     
			cin>>x;
			mp[x].push_back(i);
			v.push_back(x);
			maxnum=max(maxnum,x);
		}
		
		int flag=0,ans=0;
			for(auto y:mp[maxnum]){
     
				if(y-1>=0 && v[y-1]<maxnum)  //左边有比他小
				{
     
					ans=y+1; //下标从0开始，所以要+1
					flag=1;
					break;
				}
				else if(y+1<n && v[y+1]<maxnum) //右边有比他大
				{
     
					ans=y+1; 
					flag=1;
					break;
				}
			}
			
		
		if(flag==0) cout<<-1<<endl; //找不到
		else cout<<ans<<endl;
	}
	return 0;
}