cf1204D(div2)

字符串好题

题意:

• 给定01串s
• 要求找一个同等长度的01串t, 且要求在任意相同区间内, s和t拥有相同的最长不下降子序列, 且要求’0’的字符最多;

easy-version数据范围: $n\le 2000$

>> face <<

dp

试了几个例子之后发现每个地方的改动只对后方的数组有影响, 于是发现必须倒着遍历, 然后暴力求出每个串的最长不下降子序列, 然后靠暴力比较每个子区间的最长不下降长度, 如果改了之后和原来不一样就改回来

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << endl;
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
const int maxn = 2e3 + 10;
int nxt() {
	int ret;
	scanf("%d", &ret);
	return ret;
}
int val[2][maxn];
string a;
void LIS(string w, int st, int s) {
	int max0 = 0; int max1 = 0;
	_for(i, st, w.size()) {
		if (w[i] == '0')max0++;
		else
			max1 = max(max0, max1) + 1;
		val[s][i] = max(max0, max1);

	}
}
int main() {
	ios::sync_with_stdio(0);
	cin >> a;
	string t(a);
	for (int i = a.size() - 1; i >= 0; i--) {
		if (a[i] == '1') {
			t[i] = '0';
			LIS(t, i, 1);
			LIS(a, i, 0);
			_for(j, i, a.size()) {
				if (val[1][j] != val[0][j]) {
					t[i] = '1';
					break;
				}
			}
		}
	}
	cout << t << endl;
}

hard-version数据范围: $n\le 10000$

>> face <<

dp

仔细考虑: 若$s[i]==1$, 我们把它改成0会有什么影响: 以该位置上1开头的LIS不变, 以该位置上0开头的LIS长度++(dp[0][i+1]+1), 而题目要保证区间LIS最大不变, 则我们控制最大的LIS是以该位置上1开头的LIS, 所以只有当(dp[1][i] >= dp[0][i + 1] + 1)的时候可以改动, 而且改动过以后还要修改dp数组, 消除后效性

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << endl;
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
const int maxn = 1e5 + 5;
string s;
int dp[2][maxn];
signed main()
{
	cin >> s;
	for (int i = s.size() - 1; i >= 0; i--)
	{
		if (s[i] == '1')
		{
			dp[1][i] = dp[1][i + 1] + 1;
			dp[0][i] = dp[0][i + 1];
		}
		else
		{
			dp[0][i] = max(dp[0][i + 1], dp[1][i + 1]) + 1;
			dp[1][i] = dp[1][i + 1];
		}
	}
	for (int i = s.size() - 1; i >= 0; i--)
	{
		if (s[i] == '1')
		{
			if (dp[1][i] >= dp[0][i + 1] + 1)
			{
				s[i] = '0';
				dp[0][i] = max(dp[0][i], dp[0][i + 1] + 1);
				dp[1][i] = dp[1][i + 1];
			}
		}
		else
		{
			dp[0][i] = max(dp[0][i + 1], dp[1][i + 1]) + 1;
			dp[1][i] = dp[1][i + 1];
		}
	}
	cout << s << endl;
}