<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[MALONG11124的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/MALONG11124</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; MALONG11124]]></copyright><item><title><![CDATA[Buy and Resell(HDU6438)]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/82284338</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/82284338</guid><author>MALONG11124</author><pubDate>Sat, 01 Sep 2018 09:48:57 +0800</pubDate><description><![CDATA[Problem Description

The Power Cube is used as a stash of Exotic Power. There are n cities numbered 1,2,…,n where allowed to trade it. The trading price of the Power Cube in the i-th city is ai dollar...]]></description><category></category></item><item><title><![CDATA[Snacks(HDU5692)]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/82253128</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/82253128</guid><author>MALONG11124</author><pubDate>Fri, 31 Aug 2018 12:07:49 +0800</pubDate><description><![CDATA[Problem Description

百度科技园内有n个零食机，零食机之间通过n−1条路相互连通。每个零食机都有一个值v，表示为小度熊提供零食的价值。
由于零食被频繁的消耗和补充，零食机的价值v会时常发生变化。小度熊只能从编号为0的零食机出发，并且每个零食机至多经过一次。另外，小度熊会对某个零食机的零食有所偏爱，要求路线上必须有那个零食机。
为小度熊规划一个路线，使得路线上的价值总和最大。

...]]></description><category></category></item><item><title><![CDATA[Tree and Permutation (HDU6446)]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/82180143</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/82180143</guid><author>MALONG11124</author><pubDate>Wed, 29 Aug 2018 11:10:48 +0800</pubDate><description><![CDATA[Problem Description

There are N vertices connected by N−1 edges, each edge has its own length.
The set { 1,2,3,…,N } contains a total of N! unique permutations, let’s say the i-th permutation is Pi a...]]></description><category></category></item><item><title><![CDATA[Recovering BST(cf505 D)]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/82012761</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/82012761</guid><author>MALONG11124</author><pubDate>Fri, 24 Aug 2018 10:23:53 +0800</pubDate><description><![CDATA[Dima the hamster enjoys nibbling different things: cages, sticks, bad problemsetters and even trees!

Recently he found a binary search tree and instinctively nibbled all of its edges, hence messing u...]]></description><category></category></item><item><title><![CDATA[Girls' research (HDU - 3294)]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/81866684</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/81866684</guid><author>MALONG11124</author><pubDate>Mon, 20 Aug 2018 10:18:02 +0800</pubDate><description><![CDATA[One day, sailormoon girls are so delighted that they intend to research about palindromic strings. Operation contains two steps: 
First step: girls will write a long string (only contains lower case) ...]]></description><category></category></item><item><title><![CDATA[U - 吉哥系列故事――完美队形II( HDU - 4513 )]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/81865387</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/81865387</guid><author>MALONG11124</author><pubDate>Mon, 20 Aug 2018 09:00:25 +0800</pubDate><description><![CDATA[　吉哥又想出了一个新的完美队形游戏！ 
　　假设有n个人按顺序站在他的面前，他们的身高分别是h[1], h[2] ... h[n]，吉哥希望从中挑出一些人，让这些人形成一个新的队形，新的队形若满足以下三点要求，则就是新的完美队形： 
　　1、挑出的人保持原队形的相对顺序不变，且必须都是在原队形中连续的； 
　　2、左右对称，假设有m个人形成新的队形，则第1个人和第m个人身高相同，第2个人和第m-1...]]></description><category></category></item><item><title><![CDATA[Theme Section (HDU - 4763 )]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/81835842</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/81835842</guid><author>MALONG11124</author><pubDate>Sun, 19 Aug 2018 10:42:26 +0800</pubDate><description><![CDATA[It's time for music! A lot of popular musicians are invited to join us in the music festival. Each of them will play one of their representative songs. To make the programs more interesting and challe...]]></description><category></category></item><item><title><![CDATA[最长回文 （HDU3068 Manacher）]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/81810814</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/81810814</guid><author>MALONG11124</author><pubDate>Sat, 18 Aug 2018 17:17:06 +0800</pubDate><description><![CDATA[给出一个只由小写英文字符a,b,c...y,z组成的字符串S,求S中最长回文串的长度. 
回文就是正反读都是一样的字符串,如aba, abba等

Input

输入有多组case,不超过120组,每组输入为一行小写英文字符a,b,c...y,z组成的字符串S 
两组case之间由空行隔开(该空行不用处理) 
字符串长度len &amp;lt;= 110000

Output

每一行一个整数x,对应一组...]]></description><category></category></item><item><title><![CDATA[UPC 6910 洗衣服]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/81558658</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/81558658</guid><author>MALONG11124</author><pubDate>Fri, 10 Aug 2018 10:30:07 +0800</pubDate><description><![CDATA[题目描述

你现在要洗L件衣服。你有n台洗衣机和m台烘干机。由于你的机器非常的小，因此你每次只能洗涤(烘干)一件衣服。
第i台洗衣机洗一件衣服需要wi分钟，第i台烘干机烘干一件衣服需要di分钟。请问把所有衣服洗干净并烘干，最少需要多少时间？假设衣服在机器间转移不需要时间，并且洗完的衣服可以过一会再烘干。

 

输入

输入第一行有3个整数L,n和m。第二行有n个整数w1,w2,...,wn。第三...]]></description><category></category></item><item><title><![CDATA[异或序列(UPC6759)]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/81504594</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/81504594</guid><author>MALONG11124</author><pubDate>Wed, 08 Aug 2018 11:10:52 +0800</pubDate><description><![CDATA[题目描述

已知一个长度为n的整数数列a1,a2,…,an，给定查询参数l、r，问在al,al+1,…,ar区间内，有多少子序列满足异或和等于k。也就是说，对于所有的x,y(l≤x≤y≤r)，满足ax⊕ax+1⊕⋯⊕ay=k的x,y有多少组。

 

输入

输入第一行为3个整数n,m,k。第二行为空格分开的n个整数，即a1,a2,…,an。接下来m行，每行两个整数lj,rj，代表一次查询。

 ...]]></description><category></category></item><item><title><![CDATA[Beautiful Now（HDU6351）]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/81474861</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/81474861</guid><author>MALONG11124</author><pubDate>Tue, 07 Aug 2018 09:14:22 +0800</pubDate><description><![CDATA[Problem Description

Anton has a positive integer n, however, it quite looks like a mess, so he wants to make it beautiful after k swaps of digits.
Let the decimal representation of n as (x1x2⋯xm)10 s...]]></description><category></category></item><item><title><![CDATA[不要62(HDU2089)]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/81459717</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/81459717</guid><author>MALONG11124</author><pubDate>Mon, 06 Aug 2018 19:25:56 +0800</pubDate><description><![CDATA[Problem Description

杭州人称那些傻乎乎粘嗒嗒的人为62（音：laoer）。
杭州交通管理局经常会扩充一些的士车牌照，新近出来一个好消息，以后上牌照，不再含有不吉利的数字了，这样一来，就可以消除个别的士司机和乘客的心理障碍，更安全地服务大众。
不吉利的数字为所有含有4或62的号码。例如：
62315 73418 88914
都属于不吉利号码。但是，61152虽然含有6和2，但不...]]></description><category></category></item><item><title><![CDATA[J	Beautiful Numbers(上海大都会赛数位dp)]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/81459442</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/81459442</guid><author>MALONG11124</author><pubDate>Mon, 06 Aug 2018 19:04:39 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/163/J
来源：牛客网
 

题目描述

NIBGNAUK is an odd boy and his taste is strange as well. It seems to him that a positive integer number is beautiful if and only if it is ...]]></description><category></category></item><item><title><![CDATA[棋盘游戏 (二分图)]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/81435916</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/81435916</guid><author>MALONG11124</author><pubDate>Sun, 05 Aug 2018 21:43:38 +0800</pubDate><description><![CDATA[小希和Gardon在玩一个游戏：对一个N*M的棋盘，在格子里放尽量多的一些国际象棋里面的“车”，并且使得他们不能互相攻击，这当然很简单，但是Gardon限制了只有某些格子才可以放，小希还是很轻松的解决了这个问题（见下图）注意不能放车的地方不影响车的互相攻击。 
所以现在Gardon想让小希来解决一个更难的问题，在保证尽量多的“车”的前提下，棋盘里有些格子是可以避开的，也就是说，不在这些格子上放车，...]]></description><category></category></item><item><title><![CDATA[The Accomodation of Students]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/81435832</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/81435832</guid><author>MALONG11124</author><pubDate>Sun, 05 Aug 2018 21:36:45 +0800</pubDate><description><![CDATA[There are a group of students. Some of them may know each other, while others don't. For example, A and B know each other, B and C know each other. But this may not imply that A and C know each other....]]></description><category></category></item><item><title><![CDATA[Fire Net]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/81435689</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/81435689</guid><author>MALONG11124</author><pubDate>Sun, 05 Aug 2018 21:31:07 +0800</pubDate><description><![CDATA[Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall. 
A blockhouse is a small castle th...]]></description><category></category></item><item><title><![CDATA[牛客2018第六场C]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/81428530</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/81428530</guid><author>MALONG11124</author><pubDate>Sun, 05 Aug 2018 10:28:03 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/144/C
来源：牛客网
 

题目描述

Oak is given N empty and non-repeatable sets which are numbered from 1 to N.
Now Oak is going to do N operations. In the i-th operation, h...]]></description><category></category></item><item><title><![CDATA[HH的项链 HYSBZ - 1878]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/81407043</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/81407043</guid><author>MALONG11124</author><pubDate>Sat, 04 Aug 2018 08:57:45 +0800</pubDate><description><![CDATA[HH有一串由各种漂亮的贝壳组成的项链。HH相信不同的贝壳会带来好运，所以每次散步 完后，他都会随意取出一

段贝壳，思考它们所表达的含义。HH不断地收集新的贝壳，因此他的项链变得越来越长。有一天，他突然提出了一

个问题：某一段贝壳中，包含了多少种不同的贝壳？这个问题很难回答。。。因为项链实在是太长了。于是，他只

好求助睿智的你，来解决这个问题。

Input

第一行：一个整数N，表示项链的长...]]></description><category></category></item><item><title><![CDATA[牛客2018多校第五场A(01分数规划)]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/81382216</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/81382216</guid><author>MALONG11124</author><pubDate>Fri, 03 Aug 2018 10:14:19 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/143/A
来源：牛客网
 

Kanade selected n courses in the university. The academic credit of the i-th course is s[i] and the score of the i-th course is c[i].

At the un...]]></description><category></category></item><item><title><![CDATA[Don't Be a Subsequence(UPC 6597)]]></title><link>https://blog.youkuaiyun.com/MALONG11124/article/details/81268206</link><guid>https://blog.youkuaiyun.com/MALONG11124/article/details/81268206</guid><author>MALONG11124</author><pubDate>Sun, 29 Jul 2018 10:08:00 +0800</pubDate><description><![CDATA[题目描述

A subsequence of a string S is a string that can be obtained by deleting zero or more characters from S without changing the order of the remaining characters. For example, arc, artistic and (an...]]></description><category></category></item></channel></rss>