Codeforces946D Timetable

题目链接： http://codeforces.com/contest/946/problem/D

题意：给出n个长度为m的01串，可将最多k个01串删除，之后每个串权值为最前和最后的1出现的距离。比如010010为4,010为1,000为0

题解：单独预处理每个串用0~k个可以减去距离的最大值，显然删除ki个一定是从左找KiL个，从右找KiR个，相加为ki, 预处理后了。dp[i][j]表示前i个串用了j个可减去的最大距离，dp[i][j] = max(dp[i][j], dp[i-1][j-l]+used[i][l])；

答案即为 allone - dp[n][k];

#include <bits/stdc++.h>

using namespace std;
#define SZ(X) ((int)X.size())
#define mp make_pair
#define pb push_back
#define RALL(X) X.rbegin(),X.rend()
#define ALL(X) X.begin(),X.end()

using ll = long long ;
using ld = long double ;

const int N = 550;
char s[N][N];//n m
int used[N][N];//n k
int dp[N][N];
int sumone;
vector<int>V[N];

int main()
{
    int n, m, k;
    scanf("%d %d %d", &n, &m, &k);
    for(int i = 1;i <= n;i ++) scanf("%s", s[i] + 1);
    for(int i = 1;i <= n;i ++) {
        for(int j = 1;j <= m;j ++) {
            if(s[i][j] == '1') {
                V[i].pb(j);
            }
        }
        if(!SZ(V[i])) continue;
        
        sumone += V[i].back() - V[i].front() + 1;
        
        used[i][SZ(V[i])] = V[i].back() - V[i].front() + 1;
        used[i][SZ(V[i])-1] = V[i].back() - V[i].front();
        used[i][0] = 0;
        
        for(int j = 1;j < SZ(V[i]) - 1 && j <= k;j++)
		{
			int l = 0, r = SZ(V[i]) - 1;
			for(int p = 0;p <= j;p ++) {
				used[i][j] = max(used[i][j], V[i].back()-V[i].front()-(V[i][r-(j-p)]-V[i][p]));
			}
		}
    }

    for(int i = 1;i <= n; i ++) {
		dp[i][0] = 0;
		for(int j = 0;j <= k;j ++) {
			for(int l=0;l<=j;l++) {
				dp[i][j]=max(dp[i][j],dp[i-1][j-l] + used[i][l]);
			}
		}
	}
	return !printf("%d\n",sumone - dp[n][k]);
}