<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[u012766950的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/u012766950</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u012766950]]></copyright><item><title><![CDATA[杭电  1596 find the safest road （最短路）]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38564641</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38564641</guid><author>u012766950</author><pubDate>Thu, 14 Aug 2014 21:51:06 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1596
这道题目与杭电2544最短路的思想是一样的，只不过是把+改成了*，输入输出有些不一样而已。

find the safest road
Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Othe]]></description><category></category></item><item><title><![CDATA[杭电 1166 敌兵布阵（线段树求和）]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38521583</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38521583</guid><author>u012766950</author><pubDate>Tue, 12 Aug 2014 21:44:11 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1166

敌兵布阵
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 43942    Accepted Submission(s): 18672]]></description><category></category></item><item><title><![CDATA[杭电 1754 I Hate It（线段树求最值）]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38518701</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38518701</guid><author>u012766950</author><pubDate>Tue, 12 Aug 2014 19:44:40 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1754

I Hate It
Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 38601    Accepted Submission(s): ]]></description><category></category></item><item><title><![CDATA[杭电 1698 Just a Hook（线段树区间修改）]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38510995</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38510995</guid><author>u012766950</author><pubDate>Tue, 12 Aug 2014 10:04:40 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1698

Just a Hook
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 17322    Accepted Submission(s)]]></description><category></category></item><item><title><![CDATA[杭电 3270 The Diophantine Equation]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38499171</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38499171</guid><author>u012766950</author><pubDate>Mon, 11 Aug 2014 21:30:28 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=3270

The Diophantine Equation
Time Limit: 1000/500 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1146    Accepted Su]]></description><category></category></item><item><title><![CDATA[杭电 2159 FATE（二维费用背包问题）]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38437247</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38437247</guid><author>u012766950</author><pubDate>Fri, 08 Aug 2014 15:16:20 +0800</pubDate><description><![CDATA[二维费用背包问题：

对于每件物品，具有两种不同的费用；选择
这件物品必须同时付出这两种代价；
对于每种代价都有一个可付出的最
大值（背包容量）
。问怎样选择物品可以得到最大的价值。设这两种代
价分别为代价
1
和代价
2
，第
i
件物品所需的两种代价分别为
a[i]
和
b[i]
。两种代价可付出的最大值（两种背包容量）分别为
V
和
U
。物品
的]]></description><category></category></item><item><title><![CDATA[杭电 2546 饭卡（01背包）]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38434209</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38434209</guid><author>u012766950</author><pubDate>Fri, 08 Aug 2014 09:17:30 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=2546

饭卡
Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 11285    Accepted Submission(s): 3880
]]></description><category></category></item><item><title><![CDATA[杭电 1248 寒冰王座（完全背包）]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38425395</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38425395</guid><author>u012766950</author><pubDate>Thu, 07 Aug 2014 21:25:53 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1248

寒冰王座
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10792    Accepted Submission(s): 5476]]></description><category></category></item><item><title><![CDATA[杭电 2191 悼念512汶川大地震遇难同胞——珍惜现在，感恩生活（多重背包）]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38415641</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38415641</guid><author>u012766950</author><pubDate>Thu, 07 Aug 2014 16:11:24 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=2191

悼念512汶川大地震遇难同胞——珍惜现在，感恩生活
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 14531    Accepted]]></description><category></category></item><item><title><![CDATA[杭电 1285 确定比赛名次（拓扑排序）]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38413519</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38413519</guid><author>u012766950</author><pubDate>Thu, 07 Aug 2014 09:57:30 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1285


确定比赛名次

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)


Total Submission(s): 11664    Accepted Submission]]></description><category></category></item><item><title><![CDATA[杭电 1025 Constructing Roads In JGShining's Kingdom（二分查找）]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38386723</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38386723</guid><author>u012766950</author><pubDate>Tue, 05 Aug 2014 17:19:14 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1025

Constructing Roads In JGShining's Kingdom
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1]]></description><category></category></item><item><title><![CDATA[完全背包问题]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38375409</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38375409</guid><author>u012766950</author><pubDate>Mon, 04 Aug 2014 21:25:26 +0800</pubDate><description><![CDATA[完全背包问题：]]></description><category></category></item><item><title><![CDATA[poj  1384 Piggy-Bank（完全背包）]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38374249</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38374249</guid><author>u012766950</author><pubDate>Mon, 04 Aug 2014 20:14:52 +0800</pubDate><description><![CDATA[http://poj.org/problem?id=1384


Piggy-Bank




Time Limit: 1000MS


Memory Limit: 10000K


Total Submissions: 7900


Accepted: 3813





Description
Before ACM can do anything]]></description><category></category></item><item><title><![CDATA[杭电 1231 最大连续子序列]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38373871</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38373871</guid><author>u012766950</author><pubDate>Mon, 04 Aug 2014 19:23:02 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1231

最大连续子序列
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 18622    Accepted Submission(s): 82]]></description><category></category></item><item><title><![CDATA[杭电 1069 Monkey and Banana]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38371135</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38371135</guid><author>u012766950</author><pubDate>Mon, 04 Aug 2014 16:28:13 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1069

Monkey and Banana
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7397    Accepted Submissi]]></description><category></category></item><item><title><![CDATA[杭电 1203 I NEED A OFFER！（01背包）]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38360823</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38360823</guid><author>u012766950</author><pubDate>Sun, 03 Aug 2014 20:46:30 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1203

I NEED A OFFER!
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 15759    Accepted Submissio]]></description><category></category></item><item><title><![CDATA[杭电 2124 Repair the Wall]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38342239</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38342239</guid><author>u012766950</author><pubDate>Fri, 01 Aug 2014 21:33:12 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=2124

Repair the Wall
Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2076    Accepted Submission]]></description><category></category></item><item><title><![CDATA[杭电2391 Filthy Rich &&杭电 2571 命运（动规）]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38341813</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38341813</guid><author>u012766950</author><pubDate>Fri, 01 Aug 2014 20:59:15 +0800</pubDate><description><![CDATA[由于这两个题目有递进关系所以把他们写在一个博客里面，希望对各位有帮助！
http://acm.hdu.edu.cn/showproblem.php?pid=2391
输入：

1
3 4
1 10 8 8
0 0 1 8
0 27 0 4
输出：


Scenario #1:
42
题目大意：就是从一个矩阵的左上角走到它的右下角，矩阵的每一个元素都有一个非0值，只有三个方向可以走]]></description><category></category></item><item><title><![CDATA[杭电 1800 Flying to the Mars（贪心）]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38333935</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38333935</guid><author>u012766950</author><pubDate>Fri, 01 Aug 2014 12:28:48 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1800

Flying to the Mars
Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10798    Accepted Submis]]></description><category></category></item><item><title><![CDATA[01背包基础 （杭电2602）]]></title><link>https://blog.youkuaiyun.com/u012766950/article/details/38322435</link><guid>https://blog.youkuaiyun.com/u012766950/article/details/38322435</guid><author>u012766950</author><pubDate>Thu, 31 Jul 2014 20:11:10 +0800</pubDate><description><![CDATA[01背包问题：
有一个体积为V的背包，有n件物品，每件物品的体积，价值分别为w[i],p[i];要从n件物品中选些放入背包中，使背包里物品的总价值最大。
动态方程：c[i][j]=max(c[i-1][j],c[i-1][j-w[i]]+p[i]).
有关动态方程方面的代码：

for (int i = 1; i <= n; i++) {    
  for (int j = 1; j ]]></description><category></category></item></channel></rss>