[Codevs1403] New Three Kingdoms hegemony (MST+DP)

Title: http://codevs.cn/problem/1403/

Analysis:

It is easy to think of a certain day, that is, to find the smallest spanning tree, and because the data range is very small, it can be violent. But the point is that if the two-day plan is different, pay more. The problem is much like bzoj1003.

Consider DP

Set W[I][J] represents the minimum cost of i~j days without a change, f[i] represents the total minimum cost for the first I day, and then enumerates the changes to the scheme on which day

F[I]=Min(f[i],f[j +k+w [j+1][i]* v* (i -j)

[Codevs1403] New Three Kingdoms hegemony (MST+DP)