Codeforces #560 (Div. 3) C. Good String（思维）

Good String

题目大意：（文末有原题）

给出一个字符串，判断需要删除多少个元素才能使串变成好串；

好串：每一个奇数位（第i位）的字符与其下一位（第i+1位）的字符不相等；空串也是好串；

思路：

二重循环，第一重判断是否是奇数位与下一位是否相同，

如果相同进入第二重循环，删去与奇数位相同的元素，直到遇到不同的；

否则进入下一个奇数位；

代码：

#include <iostream>
using namespace std;

const int maxn = 2e5 + 10;
char a[maxn], ans[maxn];

int main() {
	int n;
	cin >> n;
	cin >> a;
	int s = 0, k = 0;
	
	for(int i = 0; i < n;) {
		int d = 0;
		if(i == n - 1){
			s++;
			break;
		}
		if(a[i] == a[i + 1]) {
			int j;	//从i+1开始判断是否相等，直到不相等跳出循环，否则一直删去， 
			for(j = i + 1; j < n; j++) {
				if(a[i] == a[j]) {
					s++;
				}else {
					d = 1;
					break;
				}
			}
			if(d){
				ans[k++] = a[i];
				ans[k++] = a[j];
				i = j + 1;
			}else {	//如果d==0，就说明是循环结束，就是a[i]与其之后的元素一直相等，所以连a[i]也不要 
				s++;
				i = j + 1;
			}
		}else {
			ans[k++] = a[i];
			ans[k++] = a[i + 1];
			i += 2;
		}
	}
	
	cout << s << endl << ans << endl;
	return 0;
}

---

原题：

题目：

Let's call (yet again) a string good if its length is even, and every character in odd position of this string is different from the next character (the first character is different from the second, the third is different from the fourth, and so on). For example, the strings good, string and xyyx are good strings, and the strings bad, aa and aabc are not good. Note that the empty string is considered good.

You are given a string ss, you have to delete minimum number of characters from this string so that it becomes good.

输入：

The first line contains one integer n (1≤n≤2⋅10^5) — the number of characters in s.

The second line contains the string s, consisting of exactly nn lowercase Latin letters.

输出：

In the first line, print one integer k (0≤k≤n0≤k≤n) — the minimum number of characters you have to delete from ss to make it good.

In the second line, print the resulting string s. If it is empty, you may leave the second line blank, or not print it at all.

样例：

Input：

4
good

Output：

0
good

Input：

4
aabc

Output：

2
ab

Input：

3
aaa

Output：

3