B. Substring Removal Game

最新推荐文章于 2020-11-19 22:13:01 发布

稚皓君

最新推荐文章于 2020-11-19 22:13:01 发布

阅读量912

点赞数 1

分类专栏： # codeforces 文章标签：算法

本文链接：https://blog.csdn.net/m0_46669450/article/details/108018385

版权

codeforces 专栏收录该内容

71 篇文章 1 订阅

订阅专栏

本文介绍了一个基于字符串操作的游戏策略问题，玩家通过删除连续相同字符来获得分数，重点在于如何优化选择以最大化得分。文章提供了AC代码实现，展示了寻找并排序连续1序列的方法，以及先手玩家如何选取以达到最优解。

摘要由CSDN通过智能技术生成

传送门
B. Substring Removal Game
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Alice and Bob play a game. They have a binary string s
(a string such that each character in it is either 0 or 1). Alice moves first, then Bob, then Alice again, and so on.
During their move, the player can choose any number (not less than one) of consecutive equal characters in s and delete them.For example, if the string is 10110, there are 6possible moves (deleted characters are bold):
10110→0110
10110→1110
10110→1010
10110→1010
10110→100
10110→1011
After the characters are removed, the characters to the left and to the right of the removed block become adjacent. I. e. the following sequence of moves is valid: 10110→100→1
The game ends when the string becomes empty, and the score of each player is the number of 1-characters deleted by them.
Each player wants to maximize their score. Calculate the resulting score of Alice.

Input
The first line contains one integer T(1≤T≤500) — the number of test cases.
Each test case contains exactly one line containing a binary string s
(1≤|s|≤100).

Output
For each test case, print one integer — the resulting score of Alice (the number of 1-characters deleted by her).

Example
Input

5
01111001
0000
111111
101010101
011011110111

Output

Note
Questions about the optimal strategy will be ignored.

题意：两个人在玩一个游戏，这个游戏在一个包含0与1组成的字符串上进行操作，两个人每次可以从字符串里取出任意长的一段连续的相同的子串，得分是按取出的1的个数,问先开始操作的的人最多可以得到多少分？

思路：只有消去1才可以得分，所以找到所有的连续的1的序列再按长度排序,每次选含有1最多的区间，但先手与后手都是交叉选剩下含有最长连续1的序列区间，所以先手在按长度排序后的区间里都是隔一个往后选，这为最优解。

AC代码

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
	int b[105],n;
	char a[105];
	cin>>n;
	while(n--)
	{
		int t=0,m=0;
        cin>>a;
		for(int i=0;i<strlen(a);i++)
		{
			if(a[i]=='1')
			{
				if(a[i+1]=='1')
				t++;
				else
				{
					t++;
					b[m]=t;
					t=0;
					m++;
			    }
			}
		}
		sort(b,b+m);
		int sum=0;
		for(int i=m-1;i>=0;i-=2)
		{
			sum+=b[i];
		}
		cout<<sum<<endl;
	}return 0;
}