2019-ICPC沈阳重现:7-1 A-Leftbest

Posted 2021-03-05 dragondragon

直接用set中的upper_bound!

7-1 A-Leftbest

 

Jack is worried about being single for his whole life, so he begins to use a famous dating app. In this app, the user is shown single men/women‘s photos one by one, and the user may choose between “yes” and “no”. Choosing “yes” means an invitation while choosing “no” means nothing. The photos would be shown one by one until the number of rest photos to be shown reaches zero. Of course, efficient and single Jack would always choose “yes”.

When viewing photos, Jack would have a “fake impression point” on every photo, which is not accurate. To calculate the “true impression point” of one photo, Jack would recall the “fake impression point” of every previous photo whose “fake impression point” is larger than this photo, and regard the smallest “fake impression point” of them as the “true impression point” of this photo. Jack would like to sum the “true impression point” of all photos as the outcome of his effort.

Note that if such a larger “fake impression point” does not exist, the “true impression point” of this photo is zero.

Input

The first line contains an integer (1) --- the number of photos.

The second line contains n integers a?1??, a?2??, …, a?n?? where a?i?? (0) is the “fake impression point” of the i-th photo.

Output

Output a single integer --- the sum of the “true impression point” of all photos.

Sample Input

4
2 1 4 3

 

Sample Output

6
分析：set可是有序的哦！寻找每个数左边比他大的最小的数，累计加之————>

 

修改后AC的代码：

 

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
	int n,x;
	ll ans=0;
	set<int> s;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>x;
		s.insert(x);
		set<int>::iterator pos=s.upper_bound(x);
		if(pos!=s.end())
		{
			ans+=*pos;
		}
		else ans+=0;
	}
	cout<<ans<<endl;
}