<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[CHEN_ZAN_YU的博客]]></title><description><![CDATA[AC 人生]]></description><link>https://blog.youkuaiyun.com/qq_41374539</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_41374539]]></copyright><item><title><![CDATA[C - Help Shahhoud （18.9.30）（字符串交换的最小次数）]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82915613</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82915613</guid><author>qq_41374539</author><pubDate>Mon, 01 Oct 2018 11:45:00 +0800</pubDate><description><![CDATA[Shahhoud is participating in the first Div.3 contest on Codeforces, the first problem was:

Given two strings A and B of equal length N (N is odd), find the minimum number of steps needed to change A ...]]></description><category></category></item><item><title><![CDATA[A - Martadella Strikes Again (18.9.30)]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82914357</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82914357</guid><author>qq_41374539</author><pubDate>Sun, 30 Sep 2018 23:45:47 +0800</pubDate><description><![CDATA[Statements

Saeed and Shahhoud were attending a training camp for the ACM ICPC 2018 World Finals.

At dinner, they were very happy to see that the meal was martadella slices! A martadella slice can be...]]></description><category></category></item><item><title><![CDATA[F - Random Sort （18.9.30）（全排问题，取模问题）]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82914281</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82914281</guid><author>qq_41374539</author><pubDate>Sun, 30 Sep 2018 23:40:37 +0800</pubDate><description><![CDATA[Statements

Saeed is teaching Algorithms 1 at Damascus University, his last lecture was about sorting algorithms. As homework, he gave the students an array A of length n and asked them to sort it in ...]]></description><category></category></item><item><title><![CDATA[E - Alarm Clock （尺取法）]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82907093</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82907093</guid><author>qq_41374539</author><pubDate>Sun, 30 Sep 2018 12:20:48 +0800</pubDate><description><![CDATA[题目链接：https://cn.vjudge.net/problem/CodeForces-898D 

Every evening Vitalya sets n alarm clocks to wake up tomorrow. Every alarm clock rings during exactly one minute and is characterized by one intege...]]></description><category></category></item><item><title><![CDATA[B - Alyona and Numbers]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82906121</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82906121</guid><author>qq_41374539</author><pubDate>Sun, 30 Sep 2018 10:31:21 +0800</pubDate><description><![CDATA[题目链接：https://cn.vjudge.net/problem/CodeForces-682A

After finishing eating her bun, Alyona came up with two integers n and m. She decided to write down two columns of integers —

the first column cont...]]></description><category></category></item><item><title><![CDATA[L - Common Subsequence (最长公共子序列)(18.9.28)]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82887719</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82887719</guid><author>qq_41374539</author><pubDate>Fri, 28 Sep 2018 17:41:08 +0800</pubDate><description><![CDATA[A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = &amp;lt; x1, x2, ..., xm &amp;gt; another sequence Z = &amp;lt; z1, z2, ..., zk &amp;gt; is a ...]]></description><category></category></item><item><title><![CDATA[E - Super Jumping! Jumping! Jumping! (最大递增子串和)(18.9.28)]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82887343</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82887343</guid><author>qq_41374539</author><pubDate>Fri, 28 Sep 2018 17:22:02 +0800</pubDate><description><![CDATA[Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now. 




The game ...]]></description><category></category></item><item><title><![CDATA[G - 免费馅饼（9.27）]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82873934</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82873934</guid><author>qq_41374539</author><pubDate>Thu, 27 Sep 2018 21:43:36 +0800</pubDate><description><![CDATA[G - 免费馅饼

 

 HDU - 1176 

 

 

都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了，这馅饼别处都不掉，就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了，所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人，所以他只能在小径上接。由于gameboy平时老呆在房间里...]]></description><category></category></item><item><title><![CDATA[数塔（经典DP）]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82873536</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82873536</guid><author>qq_41374539</author><pubDate>Thu, 27 Sep 2018 21:14:37 +0800</pubDate><description><![CDATA[在讲述DP算法的时候，一个经典的例子就是数塔问题，它是这样描述的： 
有如下所示的数塔，要求从顶层走到底层，若每一步只能走到相邻的结点，则经过的结点的数字之和最大是多少？  
已经告诉你了，这是个DP的题目，你能AC吗?

Input

输入数据首先包括一个整数C,表示测试实例的个数，每个测试实例的第一行是一个整数N(1 &amp;lt;= N &amp;lt;= 100)，表示数塔的高度，接下来用N行数字表示数...]]></description><category></category></item><item><title><![CDATA[I - 最少拦截系统]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82872678</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82872678</guid><author>qq_41374539</author><pubDate>Thu, 27 Sep 2018 20:19:18 +0800</pubDate><description><![CDATA[某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹. 
怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就到这里来求救了,请帮助计算一下最少需要多少套拦截系统...]]></description><category></category></item><item><title><![CDATA[P - The Shortest Path in Nya Graph-hdu4725（双端队列+拆点）（双向边）]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82870451</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82870451</guid><author>qq_41374539</author><pubDate>Thu, 27 Sep 2018 17:31:30 +0800</pubDate><description><![CDATA[来自--望月无忧--题意：有N个点和N层..一层有X个点(0&amp;lt;=X&amp;lt;=N).两邻两层间有一条路花费C。还有M条小路在两个点之间。问从第一个点走到第N个点最短路是多少...

可以考虑在每一层增加一个点，这个点到上下层的距离是C，与本层的距离是0；

T的很惨，不太明白为什么，翻了一下大神的博客，发现这个要把每层拆成两个点来算的，要是只拆成一个点那么本层到本层的点都会是0了

时间卡的很...]]></description><category></category></item><item><title><![CDATA[O - Extended Traffic（判断负环）(spfa)(邻接表)]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82869360</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82869360</guid><author>qq_41374539</author><pubDate>Thu, 27 Sep 2018 16:41:05 +0800</pubDate><description><![CDATA[题意：有n个城市，每一个城市有一个拥挤度ai，从一个城市I到另一个城市J的时间为:(aJ-aI)^3，存在负环。问从第一个城市到达第k个城市所话的时间，如果不能到达，或者时间小于3输出？否则输出所花的时间。。

这道题存在负环，而且所以要求出来所有负环（包括负环能到达的位置）,若大于点N，说明不能到达，可以用进队列的次数来判断

Dhaka city is getting crowded and ...]]></description><category></category></item><item><title><![CDATA[dfgdfs]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82848408</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82848408</guid><author>qq_41374539</author><pubDate>Wed, 26 Sep 2018 09:14:37 +0800</pubDate><description><![CDATA[ 


#include &amp;lt;bits/stdc++.h&amp;gt;
using namespace std;
const int inf=0x3f3f3f;
int main()
{
    int t;
scanf(&quot;%d&quot;,&amp;amp;t);
        int s1=0,s2=0;
        long long sum=0;
        int x,n;
        cha...]]></description><category></category></item><item><title><![CDATA[L - PC is for kicking]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82847040</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82847040</guid><author>qq_41374539</author><pubDate>Wed, 26 Sep 2018 00:05:18 +0800</pubDate><description><![CDATA[Statements

Otvio is a calm guy with a guilty pleasure: kicking PCs. Now he is participating in a programming competition where the computers are arranged as a tree, that is, the NPCs are connected by...]]></description><category></category></item><item><title><![CDATA[B - Ignatius and the Princess IV]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82834129</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82834129</guid><author>qq_41374539</author><pubDate>Tue, 25 Sep 2018 08:19:26 +0800</pubDate><description><![CDATA[&quot;OK, you are not too bad, em... But you can never pass the next test.&quot; feng5166 says. 
&quot;I will tell you an odd number N, and then N integers. There will be a special integer among them, you have to te...]]></description><category></category></item><item><title><![CDATA[Max Sum Plus Plus]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82832064</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82832064</guid><author>qq_41374539</author><pubDate>Mon, 24 Sep 2018 21:03:57 +0800</pubDate><description><![CDATA[Now I think you have got an AC in Ignatius.L's &quot;Max Sum&quot; problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem. 
Given...]]></description><category></category></item><item><title><![CDATA[大砍刀]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82830148</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82830148</guid><author>qq_41374539</author><pubDate>Mon, 24 Sep 2018 16:50:36 +0800</pubDate><description><![CDATA[大牛：https://blog.youkuaiyun.com/liuqiyao_01/article/details/9079611]]></description><category></category></item><item><title><![CDATA[B - Dungeon Master]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82826370</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82826370</guid><author>qq_41374539</author><pubDate>Mon, 24 Sep 2018 00:15:53 +0800</pubDate><description><![CDATA[You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit north, south...]]></description><category></category></item><item><title><![CDATA[A - 棋盘问题]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82825617</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82825617</guid><author>qq_41374539</author><pubDate>Sun, 23 Sep 2018 22:39:48 +0800</pubDate><description><![CDATA[在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。

Input

输入含有多组测试数据。 
每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子的数目。 n &amp;lt;= 8 , k &amp;lt;= n...]]></description><category></category></item><item><title><![CDATA[K - Candies（用栈 求最短路，邻接表）]]></title><link>https://blog.youkuaiyun.com/qq_41374539/article/details/82818838</link><guid>https://blog.youkuaiyun.com/qq_41374539/article/details/82818838</guid><author>qq_41374539</author><pubDate>Sat, 22 Sep 2018 23:50:04 +0800</pubDate><description><![CDATA[During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distribute them. All the...]]></description><category></category></item></channel></rss>