线性DP
0.0
endinggy0
这个作者很懒,什么都没留下…
展开
-
动态规划--尺取法--HihoCoder - 1502
Description 给定一个NxM的矩阵A和一个整数K,小Hi希望你能求出其中最大(元素数目最多)的子矩阵,并且该子矩阵中所有元素的和不超过K。 Input 第一行包含三个整数N、M和K。 以下N行每行包含M个整数,表示A。 对于40%的数据,1 <= N, M <= 10 对于100%的数据,1 <= N, M <= 250 1 <= K <= 2147483647 1 <= Aij <= 10000 Output 满足条件最大的子矩阵所包含的元素数目。原创 2020-09-02 10:10:03 · 100 阅读 · 0 评论 -
DP--Ignatius and the Princess IV--HDU1029
Description “OK, you are not too bad, em… But you can never pass the next test.” feng5166 says. “I will tell you an odd number N, and then N integers. There will be a special integer among them, you have to tell me which integer is the special one after I原创 2020-08-31 19:30:56 · 71 阅读 · 0 评论 -
DP--Max Sum Plus Plus--HDU1024
Description Now I think you have got an AC in Ignatius.L’s “Max Sum” problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem. Given a consecutive number sequence S1, S2, S3, S4原创 2020-08-31 19:10:53 · 87 阅读 · 0 评论 -
DP - 01背包 - Bone Collector
Description Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave … The bone collector had a big bag with a volume of V ,and along原创 2020-06-29 18:05:50 · 96 阅读 · 0 评论