![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
区间DP
薄层
努力就有收获~
展开
-
HDU-5900 QSC and Master(区间DP)
Every school has some legends, Northeastern University is the same. Enter from the north gate of Northeastern University,You are facing the main building of Northeastern University.Ninety-nine percent of the students have not been there,It is said that t原创 2017-09-08 13:36:02 · 241 阅读 · 0 评论 -
POJ-1651 Multiplication Puzzle(区间dp)
he multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move player takes one card out of the row and scores the number of points equal to the product of the number on the card taken and the numbers on原创 2017-07-12 17:44:03 · 274 阅读 · 0 评论 -
HDU-5115 Dire Wolf(区间dp)
Dire wolves, also known as Dark wolves, are extraordinarily large and powerful wolves. Many, if not all, Dire Wolves appear to originate from Draenor. Dire wolves look like normal wolves, but these creatures are of nearly twice the size. These powerful bea原创 2017-07-12 16:55:28 · 371 阅读 · 0 评论 -
HYSBZ-3229 石子合并(GarsiaWachs算法优化)
现在有n堆石子,第i堆有ai个石子。现在要把这些石子合并成一堆,每次只能合并相邻两个,每次合并的代价是两堆石子的总石子数。求合并所有石子的最小代价。 对于 100% 的数据,1≤N≤40000; 对于 100% 的数据,1≤A≤200原创 2017-07-08 20:25:37 · 886 阅读 · 0 评论 -
CSU-1592 石子归并(区间dp)
题意:现在有n堆石子,第i堆有ai个石子。现在要把这些石子合并成一堆,每次只能合并相邻两个,每次合并的代价是两堆石子的总石子数。求合并所有石子的最小代价。 思路:入门博文讲的很详细,下面看自己的代码细节。 Code: #include #include #include #include #define LL long long using namespace std; co原创 2017-07-08 16:45:32 · 295 阅读 · 0 评论