<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[leijp]]></title><description><![CDATA[=。=          -->              /*leijp1430.tk*/]]></description><link>https://blog.youkuaiyun.com/leijp1430</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; leijp1430]]></copyright><item><title><![CDATA[差分约束的简单总结]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/79618260</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/79618260</guid><author>leijp1430</author><pubDate>Mon, 19 Mar 2018 22:16:02 +0800</pubDate><description><![CDATA[差分约束  在数学上  更多被称为线性规划作为线性规划的一种特殊情况“差分”即意味两个变量作差“约束”则意味这个差  满足一些条件比如  等于某个值   或   大于某个值   或   小于某个值例 a - b &amp;gt;= x1    b - c &amp;lt;= x2    a - c == x3而这类问题在计算机中  也一般只会要求你输出  第i个变量与第j个变量       的差    最大是多少...]]></description><category></category></item><item><title><![CDATA[心情复杂]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/78220820</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/78220820</guid><author>leijp1430</author><pubDate>Thu, 12 Oct 2017 22:46:19 +0800</pubDate><description><![CDATA[算是又回来了？
有点小激动
本来都不想再碰了
看到周围的人都很热情 自己也被感染了？
好吧  继续搞acm了


这次acm只是副业了。。
（还是高数好玩]]></description><category></category></item><item><title><![CDATA[afo]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/52038414</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/52038414</guid><author>leijp1430</author><pubDate>Tue, 26 Jul 2016 18:32:40 +0800</pubDate><description><![CDATA[两年的赌博  终究还是输了
现在看来好像我一切选择都是错误的
当时毕竟too young


昨年本来可以有个比较好的结果  没要d类  其实不用d类  （只需要noip高一点就好了
今年要了d类  冰暖




也许一切都是命运吧
反正我大约的确是乙烷了


虽然我知道以后的路还是要我自己来走 
车到山前必有路  但是对于过去的两年还是于心不忍
天时地利人和  ]]></description><category></category></item><item><title><![CDATA[noi day1 前的晚上]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/52008390</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/52008390</guid><author>leijp1430</author><pubDate>Sat, 23 Jul 2016 23:54:24 +0800</pubDate><description><![CDATA[玛德好方
感觉一瞬间什么都不会了
好像再在机房学习一个春秋
看远志楼后绿树青山


这可能是我人生中最快乐的时光了   也只有在这即将逝去的时候才最令我不舍了吧
noi的到来
我的高中也就余额不足了
好想拿到好成绩  和先哲去谈笑风生


然而越临近越觉得自己微不足道
明明考前那么淡定  此时也就抑制不住的激动了起来
我的noi大约的确是药丸了（吧？]]></description><category></category></item><item><title><![CDATA[poj3155【分数规划】]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/51248717</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/51248717</guid><author>leijp1430</author><pubDate>Tue, 26 Apr 2016 10:53:18 +0800</pubDate><description><![CDATA[我是萨比#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;cstring&amp;gt;
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;algorithm&amp;gt;
using namespace std;

int n,m;
int ans[110];
int hehe;

int U[1010],V[1010],d[1010];
bool vis[...]]></description><category></category></item><item><title><![CDATA[bzoj2756]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/51123806</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/51123806</guid><author>leijp1430</author><pubDate>Mon, 11 Apr 2016 17:56:32 +0800</pubDate><description><![CDATA[mdzz
#include 
#include 
#include 
#define LL long long
using namespace std;

const LL inf = (LL)1e15;
LL n,m,T,mx;

LL x;

LL a[2];
LL c[2];

LL ar[45][45];

LL gap[1610],h[1610];

struct edge {
	LL]]></description><category></category></item><item><title><![CDATA[scoi 010 000 001 110]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/51121453</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/51121453</guid><author>leijp1430</author><pubDate>Mon, 11 Apr 2016 14:31:56 +0800</pubDate><description><![CDATA[本来是不想写这个东西的
没进就没进
但是看见大家都在感慨  自己不写一个就过意不去了
标题取成这样  就是不想被搜索出来
如果你知道我的博客  那我也就瞒不住了


今年不需要什么具体的回忆
自己弱  足以解释一切
在此希望我校学弟


早早看清实力差距
外校毕竟太厉害


多做做比赛就知道了 tc bc cf（这个算了。。太晚了受不了


要感觉到压力  不]]></description><category></category></item><item><title><![CDATA[bzoj2150【二分图匹配】]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/51010805</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/51010805</guid><author>leijp1430</author><pubDate>Wed, 30 Mar 2016 08:03:08 +0800</pubDate><description><![CDATA[水水水。。裸最小路径覆盖。。我为何这么水。#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;cstring&amp;gt;
using namespace std;

int dx[5],dy[5];

int n,m,r,c,sz;
bool a[55][55];

struct edge {
	int v,next;
}e[10010];
int cnt,head[5010];...]]></description><category></category></item><item><title><![CDATA[poj2396【上下限最大流】]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/51010763</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/51010763</guid><author>leijp1430</author><pubDate>Wed, 30 Mar 2016 07:16:24 +0800</pubDate><description><![CDATA[poj 药丸。。居然读入优化都不给过去掉读入优化就a了害我wa一天。。。药丸#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;cstring&amp;gt;
#include &amp;lt;iostream&amp;gt;

using namespace std;

int T,n,m,c,u,v,w,st,en;

int U[5010],V[5010],UF[5010],LF[5010],...]]></description><category></category></item><item><title><![CDATA[poj1815]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/50985404</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/50985404</guid><author>leijp1430</author><pubDate>Sat, 26 Mar 2016 09:42:25 +0800</pubDate><description><![CDATA[暴力的枚举割点都可以。。#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;cstring&amp;gt;
using namespace std;

int n,st,en;

struct edge {
	int v,f,next;
}e[90000];
int head[410],cnt;

int b[210][210],a...]]></description><category></category></item><item><title><![CDATA[sgu438]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/50982417</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/50982417</guid><author>leijp1430</author><pubDate>Fri, 25 Mar 2016 17:08:32 +0800</pubDate><description><![CDATA[经典题然而我因为i打成j    j打成i   搞了1H我￥%#￥%为何如此心不在焉。。我明明很专注（吧？）。。。。。此处不忍吐槽教育妈的晚一点起床早一点睡觉不好？非要23睡 6起  弄的人都是虚的  干啥都没精神   还好意思说国民体质不好感觉自己一天不如一天了。。。浑身难受妈呀扯到那里去了。。#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;cstring&amp;gt;
#in...]]></description><category></category></item><item><title><![CDATA[poj2391]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/50977800</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/50977800</guid><author>leijp1430</author><pubDate>Fri, 25 Mar 2016 11:00:58 +0800</pubDate><description><![CDATA[二分 最大流




#include 
#include 
#include 
#include 
#define LL long long
using namespace std;

int n,m,u,v,sum;

int a[210],b[210];

LL dis[210][210];

struct mes {
	int u,v;
	LL w;
	bool operator]]></description><category></category></item><item><title><![CDATA[poj1637]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/50976594</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/50976594</guid><author>leijp1430</author><pubDate>Fri, 25 Mar 2016 07:26:29 +0800</pubDate><description><![CDATA[欧拉回路判断方法
膜板题










#include 
#include 
#include 
#include 
using namespace std;

int n,m,u,v;
int in[210],out[210];

int dis[210],gap[210];
int sum_src,sum_sik;

struct edge {
	int v,f]]></description><category></category></item><item><title><![CDATA[poj1149【sap最大流】]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/50964613</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/50964613</guid><author>leijp1430</author><pubDate>Wed, 23 Mar 2016 16:49:32 +0800</pubDate><description><![CDATA[poj1149 模板题#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;cstring&amp;gt;
#include &amp;lt;iostream&amp;gt;
using namespace std;
int n,m;

int p[1010];
int last[1010];
bool con[110][110];
int CON[110];

struct edge {
	int ...]]></description><category></category></item><item><title><![CDATA[bzoj1132【叉积】]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/50943946</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/50943946</guid><author>leijp1430</author><pubDate>Mon, 21 Mar 2016 10:56:36 +0800</pubDate><description><![CDATA[poi~~~叉积  极角排序（雾 %%%a x b + a x c = a x (b + c)注意符号  那么这道题就easy 了n2预处理所有向量枚举每一个点作为顶点的情况极角排序然后用个前缀和n^2logn卡精度sxbk。。#include &amp;lt;cmath&amp;gt;
#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;algorithm&amp;gt;
#define LL l...]]></description><category></category></item><item><title><![CDATA[bzoj1412]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/50904015</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/50904015</guid><author>leijp1430</author><pubDate>Wed, 16 Mar 2016 12:29:37 +0800</pubDate><description><![CDATA[bzoj1001 狼抓兔子bzoj1412 狼抓羊。。。什么时候来个狼抓青蛙狼爪喜羊羊。。。都是最小割。。。一个经典的最小割模型#include &amp;lt;queue&amp;gt;
#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;cstring&amp;gt;
using namespace std;

int n,m;
int a[110][110];

struct edge {
	...]]></description><category></category></item><item><title><![CDATA[bzoj2333]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/50887669</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/50887669</guid><author>leijp1430</author><pubDate>Mon, 14 Mar 2016 16:40:15 +0800</pubDate><description><![CDATA[2333333333333题号厉害  此题必做。。。据说是什么什么可并堆（没听说过orz于是自己yy了一个用splay + 线段树的作法线段树用来维护全局最大值splay维护单点最大  连通块最大作法。略。。#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;iostream&amp;gt;

using namespace std;

char s[2];

int n,q,u,v...]]></description><category></category></item><item><title><![CDATA[距scoi仅一月的时候]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/50857575</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/50857575</guid><author>leijp1430</author><pubDate>Fri, 11 Mar 2016 17:40:20 +0800</pubDate><description><![CDATA[往事历历在目
昨年的今天
大概我们正在外出学习的路上
第一次出远门  当时我还是十分的好奇又欣喜
昨年是scoi2015   并不是我这届的主场
我只是半酱油半随缘的去了
没想到省选还考的可以（主要是运气了 好吧。
最后却因为noip考得太吃屎
还是滚回来学常规。。。


转眼scoi就又要来了
在中间的时间里  除了寒暑假  我几乎就没来过机房。。
常规硬伤。。疯狂的补]]></description><category></category></item><item><title><![CDATA[bzoj1800]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/50854174</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/50854174</guid><author>leijp1430</author><pubDate>Fri, 11 Mar 2016 10:50:44 +0800</pubDate><description><![CDATA[简直暴力。。


#include 

int sum[30],n;

int read_int () {
	char c = getchar();
	int re = 0;
	for(;c > '9' || c < '0';c = getchar());
	for(;c >= '0' && c <= '9';c = getchar())
		re = re * 10 + c - '0';
]]></description><category></category></item><item><title><![CDATA[bzoj1191【二分图】]]></title><link>https://blog.youkuaiyun.com/leijp1430/article/details/50853844</link><guid>https://blog.youkuaiyun.com/leijp1430/article/details/50853844</guid><author>leijp1430</author><pubDate>Fri, 11 Mar 2016 10:26:04 +0800</pubDate><description><![CDATA[一眼看出二分图。。#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;cstring&amp;gt;

int n,m,u,v;

struct edge {
	int v,next;
}e[2010];
int cnt,head[2010];

int cc,vis[2010],Link[2010];


int read_int () {
	char c = getchar();...]]></description><category></category></item></channel></rss>