2020秋季第1周训练习题笔记

2020秋季第1周训练习题笔记

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<ai.
The piranha i can eat the piranha i+1 if the piranha i+1 exists and ai+1<ai.
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 <stdio.h>
#define N 10001
int main(){
	int t,n,a[N],i,max,f = 0;
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		for(i = 0;i < n;i++)	{
			scanf("%d",&a[i]);
			max = a[0];
			if(max < a[i])	max = a[i];
			if(a[i] == a[0]) f++;
		}
		if(f == n){
			printf("-1\n");
			f = 0;
			continue;
		}
		for(i = 1;i < n;i++){
			if(i == 1 && max == a[i] && max > a[i + 1]){
				f = i + 1;
				break;
			}else if(i == n && a[i] == max && a[i - 1] < max){
				f = i + 1;
				break;
			}else if(i != 1 && i != n && max == a[i] && (a[i - 1] < max || a[i + 1] < max)){
				f = i + 1;
				break;
			}
		}
		printf("%d\n",f);
		f = 0;
	}
	return 0;
}

会造成超时限，第二个例子未完成就会超时限。
在咨询朋友后将代码修改，将第一个for与第二个for合并写出如下代码：

#include <stdio.h>
int main()
{
	int n,a[301000];
	int panduan,max,position,total,lon;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		panduan=1,max=0,position,total=1,lon;
		scanf("%d",&lon);
		for(int j=0;j<lon;j++)
		{
			scanf("%d",&a[j]);
			if(max<a[j]) 
			{
				max=a[j];
				position=j;
			}
			if(j>=1) 
			{
				if(a[j]==a[j-1])
				{
					total++;
					if(panduan)
						position++;
				} 
				if(a[j]!=a[j-1])
					panduan=0;
			}
		}
		if(total==lon)
			printf("-1\n");
		else 
			printf("%d\n",position+1);
	}
	return 0;
}

两个代码相比，少一个for会少很多运行的时间。
在判断前一项与后一项是否相等时处理的很恰当，是我需要学习的地方。