2020牛客国庆集训派对day3 Leftbest

最新推荐文章于 2020-10-09 18:53:44 发布

原创最新推荐文章于 2020-10-09 18:53:44 发布 · 276 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

算法专栏收录该内容

131 篇文章

订阅专栏

本文介绍了一种用于约会应用中的照片评分算法实现方法。通过跟踪并计算每张照片的真实印象分来评估用户的整体努力程度。文章提供了两种代码实现方案：一种超时的朴素方法和一种高效的利用C++ STL set容器的方法。

题面

链接：https://ac.nowcoder.com/acm/contest/7830/A
来源：牛客网

题目描述
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.
在这里插入图片描述

示例1
输入
4 2 1 4 3
输出
6

超时代码

#include<stdio.h>
int cb[100009];
int main()
{
	int n;
	scanf("%d",&n);
	{
		long long ans = 0;
		int min = 0;
		for(int i=0 ; i<n ; i++){
			scanf("%d",&cb[i]);
			min = 99991177;
			int qq = 0;
			for(int j=0 ; j<i ; j++){
				if(cb[j] > cb[i] && min > cb[j]){
					min = cb[j];
				}
			}
			if(min == 99991177){
				min = 0;
			}
			ans += min;
		}
		printf("%lld\n",ans);
	}
}

通过代码

#include<bits/stdc++.h>
using namespace std;
set<int>cb;
int main()
{
	int n;
	long long ans = 0;
	
	cb.clear();
	scanf("%d",&n);
	for(int i=0 ; i<n ; i++){
		int q;
		scanf("%d",&q);
		if(cb.upper_bound(q) != cb.end())
		ans += *cb.upper_bound(q);
		
		cb.insert(q);
	}
	printf("%lld\n",ans);
}