区间DP BZOJ题目传送门 洛谷题目传送门 设 f [ l ] [ r ] f[l][r] f[l][r]为涂 [ l , r ] [l,r] [l,r]需要的最少次数。那么若左右端点的颜色相同,则有 f [ l ] [ r ] = m i n ( f [ l + 1 ] [ r ] , f [ l ] [ r − 1 ] ) f[l][r]=min(f[l+1][r],f[l][r-1]) f[l][r</