CodeForces - 1490E Accidental Victory

Accidental Victory CodeForces - 1490E

题目

A championship is held in Berland, in which n players participate. The player with the number i has ai (ai≥1) tokens.

The championship consists of n−1 games, which are played according to the following rules:

in each game, two random players with non-zero tokens are selected;
the player with more tokens is considered the winner of the game (in case of a tie, the winner is chosen randomly);
the winning player takes all of the loser’s tokens;
The last player with non-zero tokens is the winner of the championship.

All random decisions that are made during the championship are made equally probable and independently.

For example, if n=4, a=[1,2,4,3], then one of the options for the game (there could be other options) is:

during the first game, the first and fourth players were selected. The fourth player has more tokens, so he takes the first player’s tokens. Now a=[0,2,4,4];
during the second game, the fourth and third players were selected. They have the same number of tokens, but in a random way, the third player is the winner. Now a=[0,2,8,0];
during the third game, the second and third players were selected. The third player has more tokens, so he takes the second player’s tokens. Now a=[0,0,10,0];
the third player is declared the winner of the championship.
Championship winners will receive personalized prizes. Therefore, the judges want to know in advance which players have a chance of winning, i.e have a non-zero probability of winning the championship. You have been asked to find all such players.

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

The first line of each test case consists of one positive integer n (1≤n≤2⋅105) — the number of players in the championship.

The second line of each test case contains n positive integers a1,a2,…,an (1≤ai≤109) — the number of tokens the players have.

It is guaranteed that the sum of n over all test cases does not exceed 2⋅105.

Output
For each test case, print the number of players who have a nonzero probability of winning the championship. On the next line print the numbers of these players in increasing order. Players are numbered starting from one in the order in which they appear in the input.

Example
Input
2
4
1 2 4 3
5
1 1 1 1 1
Output
3
2 3 4
5
1 2 3 4 5

题意

给一组数字,随机两个数字进行匹配,大的那个数字获胜(大小相同双方都有可能获胜),求,可能获胜的人有哪些,并打印他们的下标

如果一个数字有可能获胜,则,比他小的数字累加起来,应该比他的上一位比它大的数字大,根据这个原理,我们可以从后往前进行推导,如代码中1所在
可以先排序,利用前缀和,然后遍历前缀和数组进行比较进行比较,找到临界点即可

代码

#include<bits/stdc++.h>
#define ll long long 

using namespace std;

ll cb[400000];
ll cb2[400000];
ll kb[400000];
int main()
{
	ll n;
	cin>>n;
	while(n--){
		ll p,a,b;
		cin>>p;
		for(ll i=1 ; i<=p ; i++){//创造排序数组cb2 
			cin>>cb[i];
			cb2[i] = cb[i];
		}
		ll sum = 0;
		sort(cb2+1,cb2+p+1);//排序 
		kb[1] = cb2[1];
		for(ll i=2 ; i<=p ; i++){//前缀和kb
			kb[i] = cb2[i] + kb[i-1];
		}
		ll cnt = 0;
		for(ll i=p-1 ; i>=1 ; i--){//1
			if(cb2[i+1]>kb[i]){
				cnt = cb2[i];
				break;//没ac的原因是这里少了break 
			}
		}
		ll qqq = 0;
		for(ll i=1 ; i<=p ; i++){
			if(cb[i]>cnt){
				qqq ++;
			}
		}
		if(qqq>0)
		cout<<qqq<<"\n";
		for(ll i=1 ; i<=p ; i++){
			if(cb[i]>cnt){
				cout<<i<<" ";
			}
		}
		if(qqq>0)
		cout<<"\n";
	}
}