Codeforces Beta Round #2-A. Winner—

题目链接：http://codeforces.com/problemset/problem/2/A

题目描述：

The winner of the card game popular in Berland “Berlogging” is determined according to the following rules. If at the end of the game there is only one player with the maximum number of points, he is the winner. The situation becomes more difficult if the number of such players is more than one. During each round a player gains or loses a particular number of points. In the course of the game the number of points is registered in the line “name score”, where name is a player’s name, and score is the number of points gained in this round, which is an integer number. If score is negative, this means that the player has lost in the round. So, if two or more players have the maximum number of points (say, it equals to m) at the end of the game, than wins the one of them who scored at least m points first. Initially each player has 0 points. It’s guaranteed that at the end of the game at least one player has a positive number of points.

输入：

The first line contains an integer number n (1 ≤ n ≤ 1000), n is the number of rounds played. Then follow n lines, containing the information about the rounds in “name score” format in chronological order, where name is a string of lower-case Latin letters with the length from 1 to 32, and score is an integer number between -1000 and 1000, inclusive.

输出：

Print the name of the winner.

输入输出样例：

题解：

题目意思：要求求出得分最大的名字，如果有多个得分最大的名字，那么输出在这些名字中，在游戏过程中最先到达该最大得分的名字。(注意：不是在游戏完成后，只要在游戏过程中到达过该最大得分就可以。但这些名字对应的分数一定在游戏结束后是最大的).
题解：确定数据存储结构，一个结构体用来输入(这样可以同时用 i 记录得分顺序)，两个map，m 是第一遍存储分数，用来得到整个游戏结束后的最大值；t 是第二遍存储分数，用来存储，在游戏过程中的分数。因此，只需要找到 t[name] 大于等于最大分数，并且m[name] == 最大值的那个位置即可，也就是：if (t[a[i].str] >= maxn && m[a[i].str] == maxn)

参考代码：

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;#define MAX_NUM 200005
#define INF 0x3f3f3f
#define ll long long
#define clean(arrays) memset(arrays, 0, sizeof(arrays))struct score
{string str;int s;
}a[1005];
int n, s;
map<string, int> m, t;
string str;int main()
{cin>>n;for (int i = 1; i <= n; i++){cin>>a[i].str>>a[i].s;m[a[i].str] += a[i].s;      //记录每个人的总分}int maxn = -INF;for (int i = 1; i <= n; i++){if (m[a[i].str] > maxn)maxn = m[a[i].str];}   //找出游戏结束时的最大值int minn = INF;for (int i = 1; i <= n; i++){t[a[i].str] += a[i].s;if (t[a[i].str] >= maxn && m[a[i].str] == maxn){    //找到等于最大值的人中，谁先到达最大值minn = i;break;}}cout<<a[minn].str<<endl;return 0;
}

Codeforces Beta Round #2-A. Winner——算法笔记相关推荐

Codeforces Beta Round #17 D. Notepad (数论 + 广义欧拉定理降幂)
Codeforces Beta Round #17 题目链接:点击我打开题目链接大概题意: 给你 \(b\),\(n\),\(c\). 让你求:\((b)^{n-1}*(b-1)\%c\). \(2 ...
Codeforces Beta Round #5 B. Center Alignment 模拟题
B. Center Alignment 题目连接: http://www.codeforces.com/contest/5/problem/B Description Almost every tex ...
Codeforces Beta Round #75 (Div. 1 Only) B. Queue 线段树。单点更新
http://codeforces.com/problemset/problem/91/B 题意: 给你n个数,求得i 到n中小于a[i]的最右边的a[j],然后求a[i]到a[j]之间包含了多少个数 ...
Codeforces Beta Round #51 D. Beautiful numbers 数位dp + 状态优化
传送门文章目录题意: 思路: 题意: 思路: 数位dpdpdp挺经典的一个题辣,有一个很明显的状态就是f[pos][num][lcm]f[pos][num][lcm]f[pos][num][lcm ...
Codeforces Beta Round #22 (Div. 2 Only) E. Scheme（DFS+强连通）
题目大意给了 n(2<=n<=105) 个点,从每个点 u 出发连向了一个点 v(共 n 条边) 现在要求添加最少的边使得整个图是一个强连通图做法分析这道题千万不要一般化:先求强连通 ...
codeforces beta round 1
codeforces beta round 1 A Theatre Square in the capital city of Berland has a rectangular shape with ...
Codeforces Beta Round #4 (Div. 2 Only)
Codeforces Beta Round #4 (Div. 2 Only) A 水题 1 #include<bits/stdc++.h> 2 using namespace std; 3 ...
Codeforces Beta Round #7
Codeforces Beta Round #7 http://codeforces.com/contest/7 A 水题 1 #include<bits/stdc++.h> 2 usin ...
Codeforces Beta Round #1 A,B,C
A. Theatre Square time limit per test:1 second memory limit per test:256 megabytes input:standard in ...

Codeforces Beta Round #2-A. Winner——算法笔记

题目链接：http://codeforces.com/problemset/problem/2/A

题目描述：

输入：

输出：

输入输出样例：

题解：

参考代码：

Codeforces Beta Round #2-A. Winner——算法笔记相关推荐

最新文章

热门文章