<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[acy4225的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/acy4225</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; acy4225]]></copyright><item><title><![CDATA[BZOJ 1189  二分匹配  ||  最大流]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191631</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191631</guid><author>acy4225</author><pubDate>Thu, 24 Sep 2015 20:11:00 +0800</pubDate><description><![CDATA[1189: [HNOI2007]紧急疏散evacuate
Time Limit:10 SecMemory Limit:162 MBSubmit:1155Solved:420[Submit][Status][Discuss]
Description

发生了火警，所有人员需要紧急疏散！假设每个房间是一个N M的矩形区域。每个格子如果是'.'，那么表示这是一块空地...]]></description><category></category></item><item><title><![CDATA[二分匹配各种姿势]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191630</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191630</guid><author>acy4225</author><pubDate>Tue, 22 Sep 2015 18:37:00 +0800</pubDate><description><![CDATA[转自：http://endlesscount.blog.163.com/blog/static/821197872012622103810976/
一、二分图最大匹配
   定义：匹配是图中一些边的集合，且集合中任意两条边都没有公共点，所有的匹配中，边数最多的就是最大匹配。
   算法：用匈牙利算法可以在O(V*E)的复杂度内求出二分图的最大匹配，具体可以看byvo...]]></description><category></category></item><item><title><![CDATA[CF #296 (Div. 1)  B. Clique Problem 贪心（构造）]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191625</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191625</guid><author>acy4225</author><pubDate>Sun, 13 Sep 2015 18:07:00 +0800</pubDate><description><![CDATA[B. Clique Problem

time limit per test
2 seconds

memory limit per test
256 megabytes

input
standard input

output
standard output


The clique problem is one of the most well-k...]]></description><category></category></item><item><title><![CDATA[CF #296 (Div. 1) A. Glass Carving 线段树]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191623</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191623</guid><author>acy4225</author><pubDate>Sun, 13 Sep 2015 16:22:00 +0800</pubDate><description><![CDATA[A. Glass Carving

time limit per test
2 seconds

memory limit per test
256 megabytes

input
standard input

output
standard output


Leonid wants to become a glass carver (the pe...]]></description><category></category></item><item><title><![CDATA[USACO Milking Cows]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191629</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191629</guid><author>acy4225</author><pubDate>Sun, 06 Sep 2015 15:45:00 +0800</pubDate><description><![CDATA[思路：
脑抽了，一看题目，这不就是线段树么，离散化区间合并。。最终发现我并不会写。。。于是看了下题目范围10^6。。。模拟水之。。每个区间左端点+1，右端点-1，从左到右扫一下就行了。。。

代码：


 1 /*
 2     ID:xu baoqi
 3     LANG:C++
 4     TASK:milk2
 5 */
 6 
 7 #include...]]></description><category></category></item><item><title><![CDATA[洛谷 1004 dp或最大费用流]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191628</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191628</guid><author>acy4225</author><pubDate>Tue, 01 Sep 2015 12:34:00 +0800</pubDate><description><![CDATA[思路：
dp方法：
　　　　设dp[i][j][k][l]为两条没有交叉的路径分别走到(i，j)和(k，l)处最大价值。
　　　　则转移方程为
　　　　dp[i][j][k][l]=max(dp[i-1][j][k-1][l],dp[i][j-1][k-1][l],dp[i-1][j][k][l-1],dp[i][j-1][k][l-1])+map[i][j]+map[k][l]...]]></description><category></category></item><item><title><![CDATA[POJ 2923 状压好题]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191627</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191627</guid><author>acy4225</author><pubDate>Fri, 17 Jul 2015 21:09:00 +0800</pubDate><description><![CDATA[Relocation




Time Limit:1000MS

Memory Limit:65536K


Total Submissions:2631

Accepted:1075




Description

Emma and Eric are moving to their new house they bought aft...]]></description><category></category></item><item><title><![CDATA[HDU 1513 最长子序列]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191620</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191620</guid><author>acy4225</author><pubDate>Fri, 17 Jul 2015 15:50:00 +0800</pubDate><description><![CDATA[Palindrome
Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3641Accepted Submission(s): 1252
Problem Description
A palindrome is a sy...]]></description><category></category></item><item><title><![CDATA[HDU 3033 分组背包变形（每种至少一个）]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191626</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191626</guid><author>acy4225</author><pubDate>Fri, 17 Jul 2015 15:43:00 +0800</pubDate><description><![CDATA[I love sneakers!
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4464Accepted Submission(s): 1824
Problem Description
After months o...]]></description><category></category></item><item><title><![CDATA[HDU 1712 分组背包]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191624</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191624</guid><author>acy4225</author><pubDate>Fri, 17 Jul 2015 15:33:00 +0800</pubDate><description><![CDATA[ACboy needs your help
Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4912Accepted Submission(s): 2651
Problem Description
ACboy has...]]></description><category></category></item><item><title><![CDATA[HDU 3016 线段树区间更新+spfa]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191617</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191617</guid><author>acy4225</author><pubDate>Fri, 17 Jul 2015 15:26:00 +0800</pubDate><description><![CDATA[Man Down
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1836Accepted Submission(s): 665
Problem Description
The Game “Man Down 100 ...]]></description><category></category></item><item><title><![CDATA[POJ 2828 线段树(想法)]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191621</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191621</guid><author>acy4225</author><pubDate>Fri, 17 Jul 2015 15:17:00 +0800</pubDate><description><![CDATA[Buy Tickets




Time Limit:4000MS

Memory Limit:65536K


Total Submissions:15422

Accepted:7684




Description

Railway tickets were difficult to buy around the Lunar Ne...]]></description><category></category></item><item><title><![CDATA[POJ 2184 01背包+负数处理]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191615</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191615</guid><author>acy4225</author><pubDate>Wed, 15 Jul 2015 20:38:00 +0800</pubDate><description><![CDATA[Cow Exhibition




Time Limit:1000MS

Memory Limit:65536K


Total Submissions:10200

Accepted:3977




Description
"Fat and docile, big and dumb, they look so stupid, they...]]></description><category></category></item><item><title><![CDATA[HDU 2955 01背包（思维）]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191613</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191613</guid><author>acy4225</author><pubDate>Wed, 15 Jul 2015 16:02:00 +0800</pubDate><description><![CDATA[Robberies
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15649Accepted Submission(s): 5747
Problem Description
The aspiring Roy the...]]></description><category></category></item><item><title><![CDATA[HDU 1171 背包]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191611</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191611</guid><author>acy4225</author><pubDate>Wed, 15 Jul 2015 14:30:00 +0800</pubDate><description><![CDATA[Big Event in HDU
Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28020Accepted Submission(s): 9864
Problem Description
Nowadays, we...]]></description><category></category></item><item><title><![CDATA[HDU 1561 树形DP入门]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191610</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191610</guid><author>acy4225</author><pubDate>Wed, 15 Jul 2015 13:48:00 +0800</pubDate><description><![CDATA[The more, The Better
Time Limit: 6000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6011Accepted Submission(s): 3555
Problem Description
ACboy很喜欢玩一...]]></description><category></category></item><item><title><![CDATA[POJ 3694 tarjan 桥+lca]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191619</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191619</guid><author>acy4225</author><pubDate>Tue, 14 Jul 2015 21:39:00 +0800</pubDate><description><![CDATA[Network




Time Limit:5000MS

Memory Limit:65536K


Total Submissions:7298

Accepted:2651




Description

A network administrator manages a large network. The network c...]]></description><category></category></item><item><title><![CDATA[POJ 2446 最小点覆盖]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191585</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191585</guid><author>acy4225</author><pubDate>Mon, 13 Jul 2015 21:08:00 +0800</pubDate><description><![CDATA[Chessboard




Time Limit:2000MS

Memory Limit:65536K


Total Submissions:14787

Accepted:4607




Description
Alice and Bob often play games on chessboard. One day, Alice...]]></description><category></category></item><item><title><![CDATA[POJ 2226 最小点覆盖（经典建图）]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191582</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191582</guid><author>acy4225</author><pubDate>Mon, 13 Jul 2015 20:14:00 +0800</pubDate><description><![CDATA[Muddy Fields




Time Limit:1000MS

Memory Limit:65536K


Total Submissions:8881

Accepted:3300




Description
Rain has pummeled the cows' field, a rectangular grid of R ...]]></description><category></category></item><item><title><![CDATA[POJ 3216 最小路径覆盖+floyd]]></title><link>https://blog.youkuaiyun.com/acy4225/article/details/101191587</link><guid>https://blog.youkuaiyun.com/acy4225/article/details/101191587</guid><author>acy4225</author><pubDate>Mon, 13 Jul 2015 00:04:00 +0800</pubDate><description><![CDATA[Repairing Company




Time Limit:1000MS

Memory Limit:131072K


Total Submissions:6646

Accepted:1788




Description

Lily runs a repairing company that services theQb...]]></description><category></category></item></channel></rss>