Codeforces 1082B Vova and Trophies（前缀+后缀）

【Codeforces 1082B Vova and Trophies（前缀+后缀）】的更多相关文章

Codeforces 1082B Vova and Trophies 模拟,水题,坑 B

Codeforces 1082B Vova and Trophies https://vjudge.net/problem/CodeForces-1082B 题目: Vova has won nn trophies in different competitions. Each trophy is either golden or silver. The trophies are arranged in a row. The beauty of the arrangement is the le…

Codeforces 1082B Vova and Trophies（前缀+后缀）

题目链接:Vova and Trophies 题意:给定长度为n的字符串s,字符串中只有G和S,只允许最多一次操作:任意位置的两个字符互换.求连续G的最长长度. 题解:维护pre和pr,nxt和nx.pre和nxt像连续子段和一样维护G的个数,pr和nx维护分别前面和后面各有多少个G. 遍历每个位置i,pre[i-1]+nxt[i+1],判断当前位置i能不能用多余的G来替换,pr和nx判断一下是否与pre和nxt相同即可,过程中更新答案. #include <cstdio> #include…

Educational Codeforces Round 55 (Rated for Div. 2) B. Vova and Trophies 【贪心】

传送门:http://codeforces.com/contest/1082/problem/B B. Vova and Trophies time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Vova has won nn trophies in different competitions. Each trophy is eit…

Educational Codeforces Round 55：B. Vova and Trophies

B. Vova and Trophies 题目链接:https://codeforc.es/contest/1082/problem/B 题意: 给出一个“GS”串,有一次交换两个字母的机会,问最大的连续“G”串是多少. 题解: 在末尾后面放一个哨兵“S”,然后扫两遍,维护S左边和右边连续的“G”分别有多少个,然后求最大就可以了. 注意并不是所有的串都可以通过交换使长度变大这种情况,比如 “SGGGGS”,处理一下就好了. 代码如下: #include <bits/stdc++.h> usin…

Codeforces Round #320 (Div. 2) [Bayan Thanks-Round] D "Or" Game 枚举+前缀后缀

D. "Or" Game time limit per test 2 seconds You are given n numbers a1, a2, ..., an. You can perfo…

Educational Codeforces Round 55 (Rated for Div. 2) B. Vova and Trophies （贪心+字符串）

B. Vova and Trophies time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Vova has won n trophies in different competitions. Each trophy is either golden or silver. The trophies are arranged in a r…