CodeForces - 934C

解题思路让我想起了 HDU6058

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 2000 + 10;
int one[maxn], two[maxn];
int a[maxn];
int main(){
    int n;
    while(scanf("%d", &n) != EOF){
        memset(one, 0, sizeof(one));
        memset(two, 0, sizeof(two));
        for(int i = 1; i <= n; i++){
            scanf("%d", &a[i]);
            one[i] = one[i-1];
            if(a[i] == 1)
            one[i]++;
        }
        one[n+1] = one[n] + (a[n] == 1);
        for(int i = n; i >= 0; i--){
            two[i] = two[i+1];
            if(a[i] == 2)
                two[i]++;
        }
//        for(int i = 1; i <= n; i++){
//            printf("%d ", two[i]);
//        }
//        printf("\n");
//        for(int i = 1; i <= n; i++){
//            printf("%d ", one[i]);
//        }
//        printf("\n");
        int o = 0, t = 0;
        int ans = 0;
        for(int p = 1; p <= n; p++){
            o = 0, t = 0;
            for(int i = 1; i <= p; i++){
                o = max(o, one[i-1] + two[i] - two[p+1]);
//                if(p == 4){
//                    printf("p = %d, i = %d, o = %d\n", p,  i, o);
//                }
            }
            for(int j = p; j<= n; j++){
                t = max(t, two[j+1] + one[j] - one[p-1]);
//                if(p == 4){
//                    printf("p = %d j = %d, t = %d\n",p,  j, t);
//                }
            }
//            printf("p = %d, ans = %d\n", p, o + t);
            ans  = max(ans, o + t);
        }
        printf("%d\n", ans);
    }

}