四边形不等式
dxyinme
这个作者很懒,什么都没留下…
展开
-
[HDU3480]Division
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 999999/400000 K (Java/Others) Problem Description Little D is really interested in the theorem of sets recently. There’s a problem that confused h...原创 2019-03-01 11:37:08 · 105 阅读 · 0 评论 -
[四边形不等式]
当大家遇到形如 dp[i][j]=min/max(dp[i][k]+dp[k+1][j]+cost[i][j])dp[i][j]=min/max(dp[i][k]+dp[k+1][j]+cost[i][j])dp[i][j]=min/max(dp[i][k]+dp[k+1][j]+cost[i][j]) ① 或者 dp[i][j]=min/max(dp[k][j−1]+cost[k+1][j])d...原创 2019-03-01 20:33:54 · 121 阅读 · 0 评论