codeforce 462DIV2 C题

转自 https://www.cnblogs.com/LQLlulu/p/8825115.html

题意

  给出一个只含有1和2的序列，有n个元素，可以选择一段区间进行翻转操作，求再反转后的最大非递减子序列的长度

分析

序列只有1和2，那么每个非递减子序列都会有一个分界点，在分界点前是1以后是2。观察可以发现，只有当翻转的区间包含这个分界点的时候，这个分界点的非递减子序列的长度才会发生变化。定义dp[i][j]为反转区间i,j，且分界点在区间i,j的最长非递减子序列的长度。

#include<bits/stdc++.h>
#define mst(a,b) memset(a,b,sizeof(a))
#define For(i, k, j) for(int i = (k); i <= (j); i++)
#define INF 2147483647
using namespace std;
inline int read()
{
    int num = 0;
    char c=' ';
    bool flag = 1;
    for(;c>'9'||c<'0';c=getchar()) if(c=='-') flag = -1;
    for(;c>='0'&&c<='9';num=(num<<1)+(num<<3)+c-48,c=getchar());
    return num * flag;
}
#define N 2050
int n;
int a[N];
int sum1[N], sum2[N];
int dp[N][N];
int main()
{
    n = read();
    sum1[0] = sum1[0] = 0;
    For(i, 1, n) {
        a[i] = read();
        if(a[i] == 1) {
			sum1[i] = sum1[i-1] + 1;
			sum2[i] = sum2[i-1];
		}
        if(a[i] == 2) {
			sum2[i] = sum2[i-1] + 1;
			sum1[i] = sum1[i-1];
		}
    }
    int ans = 0;
    For(i, 0, n-1) ans = max(ans, sum1[i] + sum2[n] - sum2[i]);
    For(i, 1, n) {
        dp[i][i] = sum1[i] + sum2[n] - sum2[i];
    }
    For(l, 2, n) { 
        For(i, 1, n-l+1) {
            int j = i+l-1;
            if(a[j] == 2 && a[i] == 1) {
                if(l > 2) dp[i][j] = dp[i+1][j-1] - 2;
                else if(l <= 2) dp[i][j] = dp[i][j-1] - 2;
            } else if(a[j] == 1 && a[i] == 2) {
                if(l > 2) dp[i][j] = dp[i+1][j-1]+2;
                else if(l <= 2) dp[i][j] = dp[i][j-1]+2;
            } else if(a[i]==a[j]) {
                if(l<=2) dp[i][j] = dp[i][j-1];
                else dp[i][j] = dp[i+1][j-1];
            }
            dp[i][j] = max(dp[i][j], sum1[j] + sum2[n] - sum2[j]);
            dp[i][j] = max(dp[i][j], sum1[i-1] + sum2[n] - sum2[i-1] + (a[j] == 1));
        }
    }
    For(i, 1, n) {
        For(j, i, n) {
            ans = max(ans, dp[i][j]);
        }
    }
    printf("%d", ans);
	return 0;
}