https://111qqz.com/en/tags/%E5%8C%BA%E9%97%B4dp/Recent content in 区间dp on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzSat, 12 Nov 2016 12:39:25 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-11-12-uva10328/Sat, 12 Nov 2016 12:39:25 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-11-12-uva10328/<p>题目链接</p> <p>题意：问长度为n，每个位置由且仅有‘H’和&rsquo;T&rsquo;组成的序列中，至少有连续k个‘H’出现的方案数。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-09-24-hdu3507/Sat, 24 Sep 2016 16:10:18 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-24-hdu3507/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=3507" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：n个数，分成若干段，每段的代价为<figure><img class="my-0 rounded-md" loading="lazy" decoding="async" fetchpriority="low" alt="" src="http://acm.hdu.edu.cn/data/images/3507-1.jpg" ></figure> ，求最小代价。</p> <p>思路：dp。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-07-26-hdu-4283/Tue, 26 Jul 2016 07:38:44 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-26-hdu-4283/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=4283" target="_blank" rel="noreferrer">hdu 4283题目链接</a></p> <p>题意：有N个人按顺序排成一排上台表演，每个都有一个num[]值，若在他是第k个上场的人，则会有num[]*(k-1)的unhappiness。台下有一个黑屋（stack），对每一个人，可以选择让他先进屋子或者直接上台。现在让你找到一个最优方案使得所有人的unhappiness之和最小。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-07-25-poj-3661-running-e58cbae997b4dp/Mon, 25 Jul 2016 16:51:22 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-25-poj-3661-running-e58cbae997b4dp/<p><a href="http://poj.org/problem?id=3661" target="_blank" rel="noreferrer">poj 3661题目链接</a></p> <p>题意：锻炼，一共n分钟，每分钟可以选择跑步或者休息，第i分钟跑步可以跑d[i]米，并增加一点疲劳度，如果选择休息，那么每分钟减少1点疲劳值。一旦开始休息，必须休息到疲劳值为0才能再次开始跑步。疲劳值不能超过m.第n分钟的时候疲劳值必须为0，否则之后会感觉身体被掏空。问n分钟最远多多远。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-07-25-poj-1651/Mon, 25 Jul 2016 15:09:40 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-25-poj-1651/<p><a href="http://poj.org/problem?id=1651" target="_blank" rel="noreferrer">poj 1651题目链接</a></p> <p>题意：n个数，删掉a[i]的得分是a[i]*a[i-1]*a[i+1]，两个端点的不允许删。问删完n-2个数得到的最小分数是多少。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-07-25-poj-3280/Mon, 25 Jul 2016 13:26:14 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-25-poj-3280/<p><a href="http://poj.org/problem?id=3280" target="_blank" rel="noreferrer">poj 3280 题目链接</a></p> <p>题意：一个字符串，给出添加一个字符或者删掉该字符的花费，问最小的话费使得字符串变成回文串。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-07-25-light-oj-1422-halloween-costumes-e58cbae997b4dp/Mon, 25 Jul 2016 11:24:27 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-25-light-oj-1422-halloween-costumes-e58cbae997b4dp/<p><a href="http://lightoj.com/volume_showproblem.php?problem=1422" target="_blank" rel="noreferrer">light oj 1422 题目链接</a></p> <p>题意：</p> <p>按顺序去参加舞会。每个舞会对衣服都有要求。可以连续穿好多件衣服。需要时候就脱下来，但是一旦脱下来，这件衣服就报废了。问最少需要几件衣服。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-07-25-poj-1141/Mon, 25 Jul 2016 08:29:03 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-25-poj-1141/<p><a href="http://poj.org/problem?id=1141" target="_blank" rel="noreferrer">poj 1141题目链接</a></p> <p>题意：给出一个括号序列，要求添加最少的括号，使得这个序列变成合法的括号匹配，输出最后的序列。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-07-25-poj2955/Mon, 25 Jul 2016 07:46:23 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-25-poj2955/<p><a href="http://poj.org/problem?id=2955" target="_blank" rel="noreferrer">poj2955题目链接</a></p> <p>题意：给出若干括号，问最大匹配数是多少。</p> <p>思路：没有思路。我知道这是dp。。。然后其他就什么都不知道了。。。转移方程？ 完全没思路。。知道了转移方程。。。。嗯，还是不会。。。边界怎么写？状态怎么推？循环顺序? 循环次序？我一点思路都没有。。。。。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-04-12-bzoj-1652/Tue, 12 Apr 2016 02:37:28 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-04-12-bzoj-1652/<h2 class="relative group">1652: [Usaco2006 Feb]Treats for the Cows <div id="1652-usaco2006-febtreats-for-the-cows" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#1652-usaco2006-febtreats-for-the-cows" aria-label="Anchor">#</a> </span> </h2> <p>Time Limit: 5 Sec  Memory Limit: 64 MB Submit: 290  Solved: 226 [<a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=1652" target="_blank" rel="noreferrer">Submit</a>][<a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=1652" target="_blank" rel="noreferrer">Status</a>][<a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=1652" target="_blank" rel="noreferrer">Discuss</a>]</p>https://111qqz.com/en/post/acm-icpc/2015/2015-04-06-hdu1160/Mon, 06 Apr 2015 16:36:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-04-06-hdu1160/<h1 class="relative group">FatMouse&rsquo;s Speed <div id="fatmouses-speed" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#fatmouses-speed" aria-label="Anchor">#</a> </span> </h1> <p><strong>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10172 Accepted Submission(s): 4521 Special Judge</strong></p>https://111qqz.com/en/post/acm-icpc/2015/2015-04-05-hdu1114/Sun, 05 Apr 2015 15:14:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-04-05-hdu1114/<p>F - Piggy-Bank</p> <p>**Time Limit:**1000MS **Memory Limit:**32768KB <strong>64bit IO Format:</strong>%I64d &amp; %I64u</p> <p>Submit <a href="http://acm.hust.edu.cn/vjudge/contest/view.action?cid=73774#status//F/0" target="_blank" rel="noreferrer">Status</a></p> <p>Description</p> <p>Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The idea behind is simple. Whenever some ACM member has any small money, he takes all the coins and throws them into a piggy-bank. You know that this process is irreversible, the coins cannot be removed without breaking the pig. After a sufficiently long time, there should be enough cash in the piggy-bank to pay everything that needs to be paid.</p>https://111qqz.com/en/post/acm-icpc/2015/2015-04-05-hdu1087/Sun, 05 Apr 2015 14:12:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-04-05-hdu1087/<p>E - Super Jumping! Jumping! Jumping!</p> <p>**Time Limit:**1000MS **Memory Limit:**32768KB <strong>64bit IO Format:</strong>%I64d &amp; %I64u</p> <p>Submit <a href="http://acm.hust.edu.cn/vjudge/contest/view.action?cid=73774#status//E/0" target="_blank" rel="noreferrer">Status</a></p> <p>Description</p> <p>Nowadays, a kind of chess game called &ldquo;Super Jumping! Jumping! Jumping!&rdquo; is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now.</p>