https://blog.youkuaiyun.com/pretend_falzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/pretend_fal/article/details/78481678https://blog.youkuaiyun.com/pretend_fal/article/details/78481678pretend_falWed, 08 Nov 2017 18:18:53 +0800https://blog.youkuaiyun.com/pretend_fal/article/details/78431056https://blog.youkuaiyun.com/pretend_fal/article/details/78431056pretend_falFri, 03 Nov 2017 07:20:04 +0800a[i] 的个数； 我们找一个 low-up 最大的后缀； 先上调； 调的距离是 min ( a[i]-b[i] ) |a[i]>b[i]; 因为这样我们 up 增加的值可以用 low 增加的值来抵消；]]>https://blog.youkuaiyun.com/pretend_fal/article/details/78431053https://blog.youkuaiyun.com/pretend_fal/article/details/78431053pretend_falFri, 03 Nov 2017 07:18:45 +0800https://blog.youkuaiyun.com/pretend_fal/article/details/78431052https://blog.youkuaiyun.com/pretend_fal/article/details/78431052pretend_falFri, 03 Nov 2017 07:17:28 +0800 以 1 为起点可以直接到达的； 我们这里叫它一类点； <2> 以该点为起点，可以直接到达 1 的； 我们这里叫它二类点； 所以我们先用 spfa 处理出来从 1 到这两种点的点权值； 统计 ans 用； 然后枚举每一个一类点； 由于我们只能走一次反边； 所以我们所要]]>https://blog.youkuaiyun.com/pretend_fal/article/details/78431050https://blog.youkuaiyun.com/pretend_fal/article/details/78431050pretend_falFri, 03 Nov 2017 07:15:53 +0800https://blog.youkuaiyun.com/pretend_fal/article/details/78431049https://blog.youkuaiyun.com/pretend_fal/article/details/78431049pretend_falFri, 03 Nov 2017 07:14:25 +0800https://blog.youkuaiyun.com/pretend_fal/article/details/78296717https://blog.youkuaiyun.com/pretend_fal/article/details/78296717pretend_falFri, 20 Oct 2017 16:17:28 +0800https://blog.youkuaiyun.com/pretend_fal/article/details/78261921https://blog.youkuaiyun.com/pretend_fal/article/details/78261921pretend_falTue, 17 Oct 2017 16:25:56 +0800 #include #include #include #define II int #define R register #define I 123456 using namespace std; II f[I][30];II n,q; int main() { scanf("%d%d",&n]]>https://blog.youkuaiyun.com/pretend_fal/article/details/78253704https://blog.youkuaiyun.com/pretend_fal/article/details/78253704pretend_falMon, 16 Oct 2017 20:16:38 +0800 input.txt // 从data中产生数据，放到input.txt中 bao_li.exe < input.txt > bao_li.txt // 把input.txt中]]>https://blog.youkuaiyun.com/pretend_fal/article/details/78249058https://blog.youkuaiyun.com/pretend_fal/article/details/78249058pretend_falMon, 16 Oct 2017 14:03:36 +0800https://blog.youkuaiyun.com/pretend_fal/article/details/78135866https://blog.youkuaiyun.com/pretend_fal/article/details/78135866pretend_falFri, 29 Sep 2017 17:21:46 +0800 超级源，超级汇，拆点，拆出的两个点之间为代表数（桌子数），代表和桌子之间的边是1，超级源（汇）与代表（桌子）之间是正无穷； <2> 超级源，超级]]>https://blog.youkuaiyun.com/pretend_fal/article/details/78125475https://blog.youkuaiyun.com/pretend_fal/article/details/78125475pretend_falThu, 28 Sep 2017 16:48:06 +0800https://blog.youkuaiyun.com/pretend_fal/article/details/78081575https://blog.youkuaiyun.com/pretend_fal/article/details/78081575pretend_falMon, 25 Sep 2017 08:41:08 +0800 #include #in]]>https://blog.youkuaiyun.com/pretend_fal/article/details/78077837https://blog.youkuaiyun.com/pretend_fal/article/details/78077837pretend_falSun, 24 Sep 2017 16:50:40 +0800https://blog.youkuaiyun.com/pretend_fal/article/details/78077173https://blog.youkuaiyun.com/pretend_fal/article/details/78077173pretend_falSun, 24 Sep 2017 15:34:54 +0800https://blog.youkuaiyun.com/pretend_fal/article/details/78074834https://blog.youkuaiyun.com/pretend_fal/article/details/78074834pretend_falSun, 24 Sep 2017 07:46:26 +0800 #include #include #define II int #define R regis]]>https://blog.youkuaiyun.com/pretend_fal/article/details/78074818https://blog.youkuaiyun.com/pretend_fal/article/details/78074818pretend_falSun, 24 Sep 2017 07:26:12 +0800https://blog.youkuaiyun.com/pretend_fal/article/details/78070917https://blog.youkuaiyun.com/pretend_fal/article/details/78070917pretend_falSat, 23 Sep 2017 15:04:03 +0800https://blog.youkuaiyun.com/pretend_fal/article/details/78060572https://blog.youkuaiyun.com/pretend_fal/article/details/78060572pretend_falFri, 22 Sep 2017 10:54:37 +0800 #include #include using namespace std; int sc[10],j=1,hp=100,jq=200,m4,m4d,ak,akd,us,usd,de,ded,ka,fi,pk,pkd,mi,mid,ly,lyd,l1,l1d; bool b=true; string s; void SHOP]]>https://blog.youkuaiyun.com/pretend_fal/article/details/78052557https://blog.youkuaiyun.com/pretend_fal/article/details/78052557pretend_falThu, 21 Sep 2017 15:30:15 +0800@<@<@>@<@]]>