dp入门
nobleman__
加油王先生
展开
-
Manthan, Codefest 17 - B - Marvolo Gaunt's Ring【动态规划水题】
Marvolo Gaunt’s Ringtime limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard outputProfessor Dumbledore is helping Harry destroy the Horcruxes. He went to G原创 2017-09-26 09:08:48 · 601 阅读 · 0 评论 -
Problem D. Dales and Hills - Gym - 101411D 【动态规划经典题 - 思维】
Problem D. Dales and Hillsvj题目链接Input le: dales.in Output le: dales.out Time limit: 2 seconds Memory limit: 256 megabytesLet’s consider a number sequence a1; · · · ; aN . We call the continuous su原创 2017-09-26 17:06:01 · 407 阅读 · 0 评论 -
HDU 1133 - Buy the Ticket 【动态规划+组合 ~递推 偶遇 卡特兰】
Buy the TicketTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7342 Accepted Submission(s): 3070Problem DescriptionThe “Harry Potter and the原创 2017-11-12 11:37:15 · 1791 阅读 · 0 评论 -
LeetCode - 746. Min Cost Climbing Stairs【简单dp】
746. Min Cost Climbing Stairs My SubmissionsBack to ContestOn a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).Once you pay the cost, you can either climb one or two s原创 2017-12-18 20:11:16 · 871 阅读 · 0 评论 -
常州大学新生寒假训练会试 D 训练技巧【dp + 单调队列优化】
题目描述 常州大学组织了新生寒假训练一共N天,每天训练可以获得的训练效果是Ei。但是如果连续训练超过K天,萌新们会受不了而被劝退。 现在负责人想知道,如何安排能保证萌新不会被劝退并且能获得最大的训练效果。 输入描述: 第一行:两个用空格隔开的整数:N和K,1≤N≤100000,1≤K≤N 第二行到N+1行:第i+1行有一个整数,表示第N天的训练效果是Ei,(0 <= Ei <...原创 2018-02-15 16:35:48 · 449 阅读 · 0 评论 -
HDU - 2585 Hotel 【简单dp】
Hotel Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 776 Accepted Submission(s): 400 Problem Description Last year summer Max traveled ...原创 2018-04-24 09:16:08 · 309 阅读 · 0 评论