<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ME4546的专栏]]></title><description><![CDATA[Fighting!]]></description><link>https://blog.youkuaiyun.com/ME4546</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ME4546]]></copyright><item><title><![CDATA[Eclipse+CDT+MinGW]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6789347</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6789347</guid><author>ME4546</author><pubDate>Mon, 19 Sep 2011 11:06:58 +0800</pubDate><description><![CDATA[http://blog.youkuaiyun.com/xuhaipeng/article/details/3978721]]></description><category></category></item><item><title><![CDATA[HDU 3657 Game]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6662959</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6662959</guid><author>ME4546</author><pubDate>Fri, 05 Aug 2011 14:17:36 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=3657
#include
using namespace std;
#define N 2550
#define M 2000000
#define inf 0x7fffffff
struct]]></description><category></category></item><item><title><![CDATA[。。。]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6662141</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6662141</guid><author>ME4546</author><pubDate>Fri, 05 Aug 2011 10:11:59 +0800</pubDate><description><![CDATA[http://starfall512.com]]></description><category></category></item><item><title><![CDATA[HDU 3277 Marriage Match III]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6658065</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6658065</guid><author>ME4546</author><pubDate>Wed, 03 Aug 2011 21:04:26 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=3277
#include
using namespace std;
#define N 800
#define M 1000000
#define inf 0x7fffffff
struct]]></description><category></category></item><item><title><![CDATA[HDU 3902 Swordsman]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6656447</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6656447</guid><author>ME4546</author><pubDate>Wed, 03 Aug 2011 12:00:30 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=3902
额外加上每两个点的中点,把N个点扩展成2*N个，然后枚举1到n点，于其对面的点相连，当作对称轴，然后看这条线段两边成对的点的连线，是否于对称轴平分且垂直，不要忘了还要平分这个条件
#]]></description><category></category></item><item><title><![CDATA[HDU 3848 CC On The Tree]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6631538</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6631538</guid><author>ME4546</author><pubDate>Mon, 25 Jul 2011 12:46:20 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=3848#include
#define N 10005
using namespace std;
#define inf 0x7fffffff
struct node{
	int next,v,]]></description><category></category></item><item><title><![CDATA[HDU 2196 Computer]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6631112</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6631112</guid><author>ME4546</author><pubDate>Mon, 25 Jul 2011 11:35:16 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=2196#include
using namespace std;
#define N 10001
struct node{
	int next,v,w;
	node(){};
	node(int]]></description><category></category></item><item><title><![CDATA[HDU 3870 Catch the Theves]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6628478</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6628478</guid><author>ME4546</author><pubDate>Sat, 23 Jul 2011 19:54:51 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=3870最小割转最短路#include
#include
using namespace std;
#include
#define N 160001
#define M 1500001
#def]]></description><category></category></item><item><title><![CDATA[poj 2773 Happy 2006]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6626846</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6626846</guid><author>ME4546</author><pubDate>Fri, 22 Jul 2011 20:58:04 +0800</pubDate><description><![CDATA[http://poj.org/problem?id=2773#include
using namespace std;
#define N 1001
bool h[N*N],flag[N*N];
int prime[N],cnt;
void init(){
	memset(h,f]]></description><category></category></item><item><title><![CDATA[HDU 3848 CC On The Tree]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6622206</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6622206</guid><author>ME4546</author><pubDate>Thu, 21 Jul 2011 10:47:02 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=3848#include
#include
#include
#include
#include
#define N 10001
using namespace std;
struct node{]]></description><category></category></item><item><title><![CDATA[HDU 2993 MAX Average Problem 斜率优化]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6622008</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6622008</guid><author>ME4546</author><pubDate>Thu, 21 Jul 2011 10:11:12 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=2993#include
using namespace std;
#define N 100005
double sum[N];
int n,k;
int q[N],head,tail;
voi]]></description><category></category></item><item><title><![CDATA[HDU 3530 Subsequence]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6620181</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6620181</guid><author>ME4546</author><pubDate>Wed, 20 Jul 2011 15:38:54 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=3530#include
using namespace std;
#define N 100005
int q_max[N],head_max,tail_max;
int q_min[N],he]]></description><category></category></item><item><title><![CDATA[HDU 3276 Star]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6618881</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6618881</guid><author>ME4546</author><pubDate>Wed, 20 Jul 2011 09:34:49 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=3276/*
题目给出了值的范围，可以二分一下答案，对每一个二分的均值，将原先序列每一个
都减去这个均值,假设这个均值可以达到，那么一定可以找到两个不连续的区间，它们
的和大于等于0.....这样]]></description><category></category></item><item><title><![CDATA[HDU 3861 The King’s Problem]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6618046</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6618046</guid><author>ME4546</author><pubDate>Tue, 19 Jul 2011 19:55:38 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=3861#include
#include
using namespace std;
#define N 5005
#define M 100005

int top,bcnt;
int stac]]></description><category></category></item><item><title><![CDATA[HDU 3849 By Recognizing These Guys, We Find Social Networks Useful]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6614918</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6614918</guid><author>ME4546</author><pubDate>Mon, 18 Jul 2011 18:22:19 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=3849#include
using namespace std;
#include
#include
#include
#include
#include
#define N 10005
#de]]></description><category></category></item><item><title><![CDATA[hdu 1011 Starship Troopers]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6613937</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6613937</guid><author>ME4546</author><pubDate>Mon, 18 Jul 2011 13:25:34 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1011#include
using namespace std;
#define N 101
int w[N],val[N];
int dp[N][N];
int n,m;
struct nod]]></description><category></category></item><item><title><![CDATA[HDU 1516 The more, The Better]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6612253</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6612253</guid><author>ME4546</author><pubDate>Sun, 17 Jul 2011 15:47:01 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1561#include
#include
using namespace std;
#define N 201
vector E[N];
int dp_temp[N][N],dp[N][N];]]></description><category></category></item><item><title><![CDATA[HDU 3594 Cactus 仙人掌]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6612036</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6612036</guid><author>ME4546</author><pubDate>Sun, 17 Jul 2011 13:04:34 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=3594#include
using namespace std;
#define N 20005
#define M 50005

int top;
int stack[N],index;
bo]]></description><category></category></item><item><title><![CDATA[HDU 3639 Hawk-and-Chicken 支持传递]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6611754</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6611754</guid><author>ME4546</author><pubDate>Sun, 17 Jul 2011 10:19:40 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=3639#include
#include
#include
#include
using namespace std;
#define N 5005
#define M 30005
int to]]></description><category></category></item><item><title><![CDATA[HDU 1520 Anniversary party]]></title><link>https://blog.youkuaiyun.com/ME4546/article/details/6611150</link><guid>https://blog.youkuaiyun.com/ME4546/article/details/6611150</guid><author>ME4546</author><pubDate>Sat, 16 Jul 2011 19:49:31 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1520#include
using namespace std;
#define N 6001
struct node{
	int father;
	int child;
	int brothe]]></description><category></category></item></channel></rss>