<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[银狼的黎明]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/MIECZ</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; MIECZ]]></copyright><item><title><![CDATA[已经搬家到cnblog]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/81173889</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/81173889</guid><author>MIECZ</author><pubDate>Mon, 23 Jul 2018 20:13:36 +0800</pubDate><description><![CDATA[地址：http://www.cnblogs.com/NeilThang/]]></description><category></category></item><item><title><![CDATA[【并查集】Connectivity @ABC049&amp;amp;ARC065/upcexam6492]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/80671227</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/80671227</guid><author>MIECZ</author><pubDate>Tue, 12 Jun 2018 21:27:03 +0800</pubDate><description><![CDATA[Connectivity时间限制: 1 Sec  内存限制: 128 MB题目描述There are N cities. There are also K roads and L railways, extending between the cities. The i-th road bidirectionally connects the pi-th and qi-th cities, and...]]></description><category></category></item><item><title><![CDATA[【倍增】T-shirt @2018acm徐州邀请赛 I]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/80600444</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/80600444</guid><author>MIECZ</author><pubDate>Wed, 06 Jun 2018 20:31:21 +0800</pubDate><description><![CDATA[问题 I: T-shirt时间限制: 1 Sec  内存限制: 64 MB题目描述JSZKC is going to spend his vacation! His vacation has N days. Each day, he can choose a T-shirt to wear. Obviously, he doesn’t want to wear a singer color T-s...]]></description><category></category></item><item><title><![CDATA[【容斥+组合数】Massage @2018acm徐州邀请赛 E]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/80591212</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/80591212</guid><author>MIECZ</author><pubDate>Wed, 06 Jun 2018 10:33:48 +0800</pubDate><description><![CDATA[问题 E: Massage时间限制: 1 Sec  内存限制: 64 MB题目描述JSZKC  feels  so  bored  in  the  classroom  that  he  wants  to  send  massages  to  his  girl  friend. However, he can’t move to his girl friend by himself. ...]]></description><category></category></item><item><title><![CDATA[【分治-前缀积后缀积】JS Window @2018acm徐州邀请赛G]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/80590942</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/80590942</guid><author>MIECZ</author><pubDate>Wed, 06 Jun 2018 10:16:02 +0800</pubDate><description><![CDATA[问题 G: JS Window时间限制: 2 Sec  内存限制: 512 MB题目描述JSZKC has an array A of N integers. More over, he has a Window of length M which means the Window can contain M continuous integers in the array. At the beg...]]></description><category></category></item><item><title><![CDATA[【数论】Factors of Factorial @upcexam6503]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/80543412</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/80543412</guid><author>MIECZ</author><pubDate>Fri, 01 Jun 2018 22:02:45 +0800</pubDate><description><![CDATA[问题 G: Factors of Factorial时间限制: 1 Sec  内存限制: 128 MB提交: 57  解决: 33[提交][状态][讨论版][命题人:admin]题目描述You are given an integer N. Find the number of the positive divisors of N!, modulo 109+7.Constraints1≤N≤103...]]></description><category></category></item><item><title><![CDATA[【倍增】Tak and Hotels II @ABC044&amp;ARC060/upcexam6463]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/80380624</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/80380624</guid><author>MIECZ</author><pubDate>Sun, 20 May 2018 11:18:17 +0800</pubDate><description><![CDATA[6463: Tak and Hotels II时间限制: 1 Sec  内存限制: 128 MB提交: 40  解决: 11[提交][状态][讨论版][命题人:admin]题目描述N hotels are located on a straight line. The coordinate of the i-th hotel (1≤i≤N) is xi.Tak the traveler has t...]]></description><category></category></item><item><title><![CDATA[【二分图最大匹配】Bullet @山东省第九届省赛 B]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/80294850</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/80294850</guid><author>MIECZ</author><pubDate>Sat, 12 May 2018 21:00:40 +0800</pubDate><description><![CDATA[
  时间限制: 6 Sec  内存限制: 128 MB 
  题目描述 
  In GGO, a world dominated by gun and steel, players are fighting for the honor of being the strongest gunmen. Player Shino is a sniper, and her aimed shot kills...]]></description><category></category></item><item><title><![CDATA[【二分图带权匹配】Anagram @山东省第九届省赛 A]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/80294615</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/80294615</guid><author>MIECZ</author><pubDate>Sat, 12 May 2018 20:29:35 +0800</pubDate><description><![CDATA[
  题目描述 
  Orz has two strings of the same length: A and B. Now she wants to transform A into an anagram of B (which means, a rearrangement of B) by changing some of its letters. The only operation th...]]></description><category></category></item><item><title><![CDATA[【容斥】Four-tuples @山东省第九届省赛 F]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/80279668</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/80279668</guid><author>MIECZ</author><pubDate>Sat, 12 May 2018 13:40:49 +0800</pubDate><description><![CDATA[(施工)

#define IN_LB() freopen(&amp;amp;quot;C:\\Users\\acm2018\\Desktop\\in.txt&amp;amp;quot;,&amp;amp;quot;r&amp;amp;quot;,stdin)
#define OUT_LB() freopen(&amp;amp;quot;C:\\Users\\acm2018\\Desktop\\out.txt&amp;amp;quot;,&amp;amp;quot;w&amp;amp;quot;,stdou]]></description><category></category></item><item><title><![CDATA[【树形dp入门】没有上司的舞会 @洛谷P1352]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/80246325</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/80246325</guid><author>MIECZ</author><pubDate>Tue, 08 May 2018 21:39:27 +0800</pubDate><description><![CDATA[传送门
  题目描述 
  某大学有N个职员，编号为1~N。他们之间有从属关系，也就是说他们的关系就像一棵以校长为根的树，父结点就是子结点的直接上司。现在有个周年庆宴会，宴会每邀请来一个职员都会增加一定的快乐指数Ri，但是呢，如果某个职员的上司来参加舞会了，那么这个职员就无论如何也不肯来参加舞会了。所以，请你编程计算，邀请哪些职员可以使快乐指数最大，求最大的快乐指数。 
  输入输出格式 
  输入]]></description><category></category></item><item><title><![CDATA[【贪心】LIS @The 15th Zhejiang Provincial Collegiate Programming Contest E]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/80144569</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/80144569</guid><author>MIECZ</author><pubDate>Wed, 02 May 2018 17:07:11 +0800</pubDate><description><![CDATA[传送门

题意要你构造一个序列，使得该序列的每个位置上的最长上升子序列的长度能构成给定的序列。 
构造序列的元素要求还要求满足给定的上下界

solution  
我们可以把给出的最长上升子序列的长度按升序排列，长度相同的按下标降序排列。 
排完序后第一个数可以贪心的取其下界，同一层（即长度相同）的下标小的取值应该大于等于下标较大的取值 
同时取值应该大于前一层下标最大且小于该位置的数

#def...]]></description><category></category></item><item><title><![CDATA[【map离散&容斥】Ghosts @Codeforces Round #478 (Div. 2) D]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/80164996</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/80164996</guid><author>MIECZ</author><pubDate>Wed, 02 May 2018 12:54:06 +0800</pubDate><description><![CDATA[传送门 
题意：给你一条直线的斜率a和截距b，和某一时刻n个在直线上的点的横坐标，以及沿坐标轴方向的速度。问你这些点在（-∞，+∞）的时间内的碰撞次数。solution 
设两个点在t时刻相碰，有： 
x1+vx1t=x2+vx2tx_1+v_{x_1}t = x_2+v_{x_2}t y1+vy1t=y2+vy2ty_1+v_{y_1}t = y_2+v_{y_2}t 
消去t，可以得到 x1−x]]></description><category></category></item><item><title><![CDATA[【二分】Producing Snow @Codeforces Round #470 Div.2 C]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/80136888</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/80136888</guid><author>MIECZ</author><pubDate>Sat, 28 Apr 2018 16:43:17 +0800</pubDate><description><![CDATA[time limit per test: 1 second 
  memory limit per test: 256 megabytes 
  Alice likes snow a lot! Unfortunately, this year’s winter is already over, and she can’t expect to have any more of it. Bob has]]></description><category></category></item><item><title><![CDATA[【枚举】Consonant Fencity @upcexam5110]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/80114428</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/80114428</guid><author>MIECZ</author><pubDate>Fri, 27 Apr 2018 22:43:50 +0800</pubDate><description><![CDATA[
  时间限制: 3 Sec  内存限制: 512 MB 
  题目描述 
  There are two kinds of sounds in spoken languages: vowels and consonants. Vowel is a sound, produced with an open vocal tract; and consonant is pronounced in su...]]></description><category></category></item><item><title><![CDATA[【暴力枚举&BFS】Flow Free @RMRC2017/upcexam5124]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/80072823</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/80072823</guid><author>MIECZ</author><pubDate>Wed, 25 Apr 2018 17:12:56 +0800</pubDate><description><![CDATA[时间限制: 1 Sec  内存限制: 128 MB 
  题目描述 
  Flow Free is a puzzle that is played on a 2D grid of cells, with some cells marked as endpoints of certain colors and the rest of cells being blank. To solve the p]]></description><category></category></item><item><title><![CDATA[【分块】教主的魔法 @洛谷P2801/upcexam3138]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/80032170</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/80032170</guid><author>MIECZ</author><pubDate>Wed, 25 Apr 2018 17:03:43 +0800</pubDate><description><![CDATA[时间限制: 1 Sec  内存限制: 128 MB 
  题目描述 
  教主最近学会了一种神奇的魔法，能够使人长高。于是他准备演示给XMYZ信息组每个英雄看。于是N个英雄们又一次聚集在了一起，这次他们排成了一列，被编号为1、2、……、N。 
  每个人的身高一开始都是不超过1000的正整数。教主的魔法每次可以把闭区间[L, R]（1≤L≤R≤N）内的英雄的身高全部加上一个整数W。（虽然L=R时并]]></description><category></category></item><item><title><![CDATA[【搜索】WAR大佬的SET @upcexam6201]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/79732043</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/79732043</guid><author>MIECZ</author><pubDate>Sun, 22 Apr 2018 16:13:06 +0800</pubDate><description><![CDATA[
  时间限制: 1 Sec  内存限制: 128 MB 
  题目描述 
  WAR大佬认为一个包含重复元素的集合认为是优美的，当且仅当集合中的元素的和等于他们的积。 
  求包含n个元素的优美的集合的个数。 
  WAR大佬当然会啊，他只是想考考你。 
  输入 
  一个正整数n（2&amp;lt;=n&amp;lt;=1000） 
  输出 
  一个数ans表示集合的个数 
  样例输入 
  5 
 ...]]></description><category></category></item><item><title><![CDATA[【动态规划】Column Addition @ICPC2017Tehran/upcexam5434]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/80030013</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/80030013</guid><author>MIECZ</author><pubDate>Sat, 21 Apr 2018 15:18:07 +0800</pubDate><description><![CDATA[时间限制: 1 Sec  内存限制: 128 MB 
  题目描述
  
  A multi-digit column addition is a formula on adding two integers written like this:  
    
  A multi-digit column addition is written on the blackboard, but the]]></description><category></category></item><item><title><![CDATA[【高精度&想法题】Count the Even Integers @ICPC2017HongKong/upcexam5563#Java]]></title><link>https://blog.youkuaiyun.com/MIECZ/article/details/79882783</link><guid>https://blog.youkuaiyun.com/MIECZ/article/details/79882783</guid><author>MIECZ</author><pubDate>Tue, 10 Apr 2018 16:07:29 +0800</pubDate><description><![CDATA[时间限制: 1 Sec  内存限制: 128 MB 
  Yang Hui’s Triangle is defined as follow. 
  In the first layer, there are two numbers A1,1 and A1,2 satisfying A1,1 = A1,2 = 1. 
  Then for each i > 1, the i-th layer cont]]></description><category></category></item></channel></rss>