Codeforces711C-Coloring Trees（dp）

题目链接

http://codeforces.com/contest/711/problem/C

思路

dp，状态还是比较好表示
状态表示：
d[i][j][k]，前i个树都已经染色， 第i棵树颜色为j，目前还能用的颜色数为k
转移方程：
如果和前一个颜色相同：d[i][j][k] = min(d[i][j][k], d[i - 1][l][k] + p[i][j]);
如果和前一个颜色不同：d[i][j][k] = min(d[i][j][k], d[i - 1][l][k + 1] + p[i][j]);

代码

#include <iostream>
#include <cstring>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <sstream>
#include <iomanip>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <deque>
#include <bitset>
#include <algorithm>
using namespace std;

#define PI acos(-1.0)
#define LL long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define mp make_pair
#define IN freopen("in.txt", "r", stdin)
#define OUT freopen("out.txt", "wb", stdout)
#define scan(x) scanf("%d", &x)
#define scan2(x, y) scanf("%d%d", &x, &y)
#define scan3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define sqr(x) (x) * (x)

const int maxn = 105;
const LL INF = 1e15;
LL d[maxn][maxn][maxn];
int n, m, K;
int p[maxn][maxn], c[maxn];

LL sovle() {
    for (int i = 0; i <= n; i++)
        for (int j = 0; j <= m; j++) {
            for (int k = 0; k <= K; k++)
                d[i][j][k] = INF;
        }
    if (c[1]) 
        for (int j = 1; j <= m; j++) {
            if (j == c[1]) d[1][j][K - 1] = 0;
            else d[1][j][K - 1] = INF;
        }
    else 
        for (int j = 1; j <= m; j++) d[1][j][K - 1] = p[1][j];
    for (int i = 2; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            for (int k = 0; k <= K - 1; k++) {
                for (int l = 1; l <= m; l++) {
                    if (c[i]) {
                        if (j != c[i]) d[i][j][k] = INF;
                        else if (l == c[i]) d[i][c[i]][k] = min(d[i][c[i]][k], d[i - 1][l][k]);
                        else d[i][c[i]][k] = min(d[i][c[i]][k], d[i - 1][l][k + 1]);
                    } else {
                        if (l == j) d[i][j][k] = min(d[i][j][k], d[i - 1][l][k] + p[i][j]);
                        else d[i][j][k] = min(d[i][j][k], d[i - 1][l][k + 1] + p[i][j]);
                    }
                }
            }
        }
    }
    LL res = 1e18;
    for (int j = 1; j <= m; j++) {
        res = min(res, d[n][j][0]);
    }
    return res == INF ? -1 : res;
}

int main() {
    scan3(n, m, K);
    for (int i = 1; i <= n; i++) scan(c[i]);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            scan(p[i][j]);
        }
    }
    printf("%I64d\n", sovle());
    return 0;

}