CodeForces 711C Coloring Trees【dp*好题】

ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park where n trees grow. They decided to be naughty and color the trees in the park. The trees are numbered with integers from 1 to n from left to right.
Initially, tree i has color ci. ZS the Coder and Chris the Baboon recognizes only m different colors, so 0 ≤ ci ≤ m, where ci = 0 means that tree i is uncolored.
ZS the Coder and Chris the Baboon decides to color only the uncolored trees, i.e. the trees with ci = 0. They can color each of them them in any of the m colors from 1 to m. Coloring the i-th tree with color j requires exactly pi, j litres of paint.
The two friends define the beauty of a coloring of the trees as the minimum number of contiguous groups (each group contains some subsegment of trees) you can split all the n trees into so that each group contains trees of the same color. For example, if the colors of the trees from left to right are 2, 1, 1, 1, 3, 2, 2, 3, 1, 3, the beauty of the coloring is 7, since we can partition the trees into 7 contiguous groups of the same color : {2}, {1, 1, 1}, {3}, {2, 2}, {3}, {1}, {3}.
ZS the Coder and Chris the Baboon wants to color all uncolored trees so that the beauty of the coloring is exactly k. They need your help to determine the minimum amount of paint (in litres) needed to finish the job.
Please note that the friends can’t color the trees that are already colored.
Input
The first line contains three integers, n, m and k (1 ≤ k ≤ n ≤ 100, 1 ≤ m ≤ 100) — the number of trees, number of colors and beauty of the resulting coloring respectively.
The second line contains n integers c1, c2, …, cn (0 ≤ ci ≤ m), the initial colors of the trees. ci equals to 0 if the tree number i is uncolored, otherwise the i-th tree has color ci.
Then n lines follow. Each of them contains m integers. The j-th number on the i-th of them line denotes pi, j (1 ≤ pi, j ≤ 109) — the amount of litres the friends need to color i-th tree with color j. pi, j’s are specified even for the initially colored trees, but such trees still can’t be colored.
Output
Print a single integer, the minimum amount of paint needed to color the trees. If there are no valid tree colorings of beauty k, print  - 1.
Example
Input
3 2 2
0 0 0
1 2
3 4
5 6
Output
10
Input
3 2 2
2 1 2
1 3
2 4
3 5
Output
-1
Input
3 2 2
2 0 0
1 3
2 4
3 5
Output
5
Input
3 2 3
2 1 2
1 3
2 4
3 5
Output
0
Note
In the first sample case, coloring the trees with colors 2, 1, 1 minimizes the amount of paint used, which equals to 2 + 3 + 5 = 10. Note that 1, 1, 1 would not be valid because the beauty of such coloring equals to 1 ({1, 1, 1} is a way to group the trees into a single group of the same color).
In the second sample case, all the trees are colored, but the beauty of the coloring is 3, so there is no valid coloring, and the answer is  - 1.
In the last sample case, all the trees are colored and the beauty of the coloring matches k, so no paint is used and the answer is 0.
题意：（真难理解）有n个点，m种颜色，你要给n个点上没有颜色的点染色。每个点i对应染的颜色j有一个颜料消耗，p[i][j]是点i染成j颜色的花费，你必须保证有k段颜色的点，输出最少花费多少颜料。
思路：题意稍微不太好理解。。。
dp[i][j][v]：位置i染第j种颜料恰好有v段颜色，所花费的颜料数量；
第i个位置没被染色：i已经确定，但j,v未知，需要暴力枚举。
第i个位置已被染色：i,j已经确定，只需要暴力枚举v。（具体方程看代码）
坑点就是初始化，还有注意找最小值。

#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long LL;

const LL INF = 1e15;
LL dp[110][110][110], a[110]; 
LL p[110][110];

void init() {
    for(int i = 1; i <= 105; i++) {
        for(int j = 1; j <= 105; j++) {
            for(int v = 1; v <= 105; v++) {
                dp[i][j][v] = INF;
            }
        }
    }
}

int main() {
    init();
    int n, m, k;
    scanf("%d %d %d", &n, &m, &k);
    for(int i = 1; i <= n; i++) {
        scanf("%lld", &a[i]);
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            scanf("%lld", &p[i][j]);
        }
    }
    LL ans = INF;
    if(!a[1]) {
        for(int i = 1; i <= m; i++) {
            dp[1][i][1] = p[1][i];
        }
    }
    else {
        dp[1][a[1]][1] = 0;
    }
    for(int i = 2; i <= n; i++) {
        if(!a[i]) {
            for(int u = 1; u <= m; u++) {
                for(int v = 1; v <= k; v++) {
                    dp[i][u][v] = min(dp[i - 1][u][v] + p[i][u], dp[i][u][v]);
                    LL cnt = INF;
                    for(int j = 1; j <= m; j++) {
                        if(j != u && v > 1) cnt = min(cnt, dp[i - 1][j][v - 1] + p[i][u]); //注意v > 1 这个判断
                    }
                    dp[i][u][v] = min(cnt, dp[i][u][v]);
                } 
            }
        }
        else {
            for(int v = 1; v <= k; v++) {
                dp[i][a[i]][v] = min(dp[i][a[i]][v], dp[i - 1][a[i]][v]);
                LL cnt = INF;
                for(int j = 1; j <= m; j++) {
                    if(j != a[i] && v > 1) cnt = min(cnt, dp[i - 1][j][v - 1]);
                }
                dp[i][a[i]][v] = min(dp[i][a[i]][v], cnt);
            }
        }
    }
    for(int j = 1; j <= m; j++) {
        ans = min(ans, dp[n][j][k]);
//      printf("#%d %d %d -> %lld\n", n, j, k, dp[n][j][k]);
    }
    if(ans < INF) printf("%lld\n", ans);
    else printf("-1\n");
    return 0;
}

/*

3 2 2
0 0 0
1 2
3 4
5 6

*/