题解CF386A【Second-Price Auction】

最新推荐文章于 2025-01-07 20:17:12 发布

原创

最新推荐文章于 2025-01-07 20:17:12 发布 · 258 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#题解

博客讲述了在解决编程竞赛题目CF386A【Second-Price Auction】时遇到的问题和解决方案。作者最初尝试用三个变量记录最大值、最大值索引及第二大值，发现这种方法无法通过样例。后来采用结构体数组，根据值对数组排序，正确找出最大值和第二大值的策略。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

此题的感想：此题难度为提高+/省选-，描述又如此简单，我顿时傻眼了，于是我就去看了看数据范围：2<=n<=1000，顿时感觉自己又A了道水题，~~事后才发现这题如此毒瘤~~

我一开始的思路：

①:存储思想：

开三个变量， $maxn,maxb,second$ 。其中

最低0.47元/天解锁文章

200万优质内容无限畅学

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

立即使用

xxyyztg

关注关注

0
点赞
踩
1

收藏

觉得还不错? 一键收藏
0
评论
分享

复制链接

分享到 QQ

分享到新浪微博

扫一扫
举报

举报

Codeforces 513C Second price auction (bruteforce)

Oh233的专栏

02-16

759

问题描述：如题所说，second price auction，讲的是几个人拍卖，出价最高的人以第二名的价格购得产品。给定的数据是第i个人出价的上下界，每种钱都是等可能性的，求最后花费钱的期望。其实曾经做过这类的游戏所以规则还是一眼即明，问题就在于题目到底该怎么做。对于每一个可能出现的价钱，枚举一种组合情况（意为对于每一个人，枚举其出的钱是大于等于该价钱，还是小于该价钱），这种时间复杂度

洛谷 CF1733D1 Zero-One (Easy Version) 题解

xzz_0611 的博客

04-19

1148

洛谷 CF1733D1 Zero-One (Easy Version) 题解

参与评论您还未登录，请先登录后发表或查看评论

ZOJ 3202 Second-price Auction （A）

weixin_30535843的博客

08-16

247

Second-price AuctionTime Limit: 1 Second Memory Limit: 32768 KBDo you know second-price auction? It's very simple but famous. In a second-price auction, each potential buyer privately submits, pe...

ZOJ 3202 Second-price Auction (模拟)

AC，∑ndless

08-31

1258

Second-price Auction http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3202 Time Limit: 1 Second Memory Limit: 32768 KB Do you know second-price auction? It's very simple bu

2014ACM集训13级PK赛4-Second-price Auction

顺便A道题

03-15

890

Description Do you know second-price auction? It's very simple but famous. In a second-price auction, each potential buyer privately submits, perhaps in a sealed envelope or over a secure connectio

A. Second-price Auction

NITjianbagengmu的博客

04-15

524

A. Second-price Auction Time Limit: 1000ms Memory Limit: 32768KB 64-bit integer IO format: %lld Java class name: Main Submit Status Font PID: 18109 Do you know second-price

python-leetcode题解之074-Search-a-2D-Matrix

08-28

python python_leetcode题解之074_Search_a_2D_Matrix

java-leetcode题解之17-Letter-Combinations-of-a-Phone-Number

08-31

java入门 java_leetcode题解之17_Letter_Combinations_of_a_Phone_Number

c语言-leetcode题解之0236-lowest-common-ancestor-of-a-binary-tree

08-30

c c语言_leetcode题解之0236_lowest_common_ancestor_of_a_binary_tree

c语言-leetcode题解之0438-find-all-anagrams-in-a-string

08-30

c c语言_leetcode题解之0438_find_all_anagrams_in_a_string

Second-price Auction

Y_yunhu的博客

08-25

1080

Do you know second-price auction? It's very simple but famous. In a second-price auction, each potential buyer privately submits, perhaps in a sealed envelope or over a secure connection, his (or ...

zoj 3202

Solidfish的专栏

10-05

1032

//3202 optimize 不使用数组，找出最大和次大的数，并记录最大数的位置#include using namespace std;int main(){ int T; scanf("%d",&T); while(T--) { int n; scanf("%d",&n); int max1=-1; int max2; sca

codeforces Second-Price Auction

笨小孩的专栏

01-23

1065

题目链接：http://codeforces.com/problemset/problem/386/A 题目意思：简单，就是有n个人投标某个东西，有n个数，找出最大的数的下标和第二大数就好了!就是这么简单。 #include #include using namespace std; int A[1001]; int main(void) { int

【打CF，学算法——三星级】CodeForces 513C Second price auction （进制状态表示）

David_Jett

07-10

1092

题目链接：CF 513C 题面： C. Second price auction time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Nowadays, mo

CodeForces - 386A Second-Price Auction

林伊的博客

05-07

412

In this problem we consider a special type of an auction, which is called the second-price auction. As in regular auction n bidders place a bid which is price a bidder ready to pay. The auction is clo...

SDOI 2010 代码拍卖会题解

a_forever_dream的博客

03-21

199

题目传送门题目大意：问位数为n的数（由1~9组成，并且要求不递减）中，有多少个数可以被p整除。神奇的思路这题n大成这个鬼样，显然是要用数位dp了，但是，很要命的是，光是把每一位过一次就已经毫无疑问地TLE了，所以，只能从p入手了。 ...

cf386 div2 A. Compote

Foxz的博客

12-18

599

A. Compotetime limit per testmemory limit per testinputoutputNikolay has a lemons, b apples and c pears. He decided to cook a compote. According to the recipe the fruits should be in the ratio 1: 2: 4.

A second-price auction