<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[baymax520的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/baymax520</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; baymax520]]></copyright><item><title><![CDATA[Manacher's Algorithm 马拉车算法]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/88412139</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/88412139</guid><author>baymax520</author><pubDate>Mon, 11 Mar 2019 23:08:50 +0800</pubDate><description><![CDATA[转载自https://www.cnblogs.com/grandyang/p/4475985.html



这个马拉车算法Manacher‘s Algorithm是用来查找一个字符串的最长回文子串的线性方法，由一个叫Manacher的人在1975年发明的，这个方法的最大贡献是在于将时间复杂度提升到了线性，这是非常了不起的。对于回文串想必大家都不陌生，就是正读反读都一样的字符串，比如 &quot;bob...]]></description><category></category></item><item><title><![CDATA[2018程设模考2]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/85163647</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/85163647</guid><author>baymax520</author><pubDate>Fri, 21 Dec 2018 16:18:57 +0800</pubDate><description><![CDATA[A

分别记录纸币剩余数量判断是否能找零，因为数据比较弱所以对于5+5+5的情况没考虑也过了。


#include&amp;lt;bits/stdc++.h&amp;gt;
using namespace std;
int main()
{
    int a=0,b=0,c=0;
    int n;
    int flag=1;
    while(scanf(&quot;%d&quot;,&amp;amp;n)!=EOF)
   ...]]></description><category></category></item><item><title><![CDATA[POJ 1837 Balance（分组背包）]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/82802939</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/82802939</guid><author>baymax520</author><pubDate>Fri, 21 Sep 2018 16:13:39 +0800</pubDate><description><![CDATA[Balance

Time Limit: 1000MS
			 
			Memory Limit: 30000K
		Total Submissions: 16611
			 
			Accepted: 10433
		Description

Gigel has a strange &quot;balance&quot; and he wants to poise it. Actually, the device ...]]></description><category></category></item><item><title><![CDATA[HDU 3033 I love sneakers!（分组背包）]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/82801681</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/82801681</guid><author>baymax520</author><pubDate>Fri, 21 Sep 2018 15:21:19 +0800</pubDate><description><![CDATA[I love sneakers!

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6928    Accepted Submission(s): 2825
 

Problem Description

After months of ...]]></description><category></category></item><item><title><![CDATA[SWERC2017 E.Ingredients（拓扑排序+01背包）]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/82800662</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/82800662</guid><author>baymax520</author><pubDate>Fri, 21 Sep 2018 14:18:42 +0800</pubDate><description><![CDATA[因为一个披萨得由另外的披萨加料制成，所以有一个先后顺序问题，用拓扑排序跑一遍，找出n种披萨的最优情况后背包即可。


#include&amp;lt;bits/stdc++.h&amp;gt;
using namespace std;
typedef long long ll;
const int maxn=1e6+5;
const int inf=0x3f3f3f3f;
int dp[maxn],deg[max...]]></description><category></category></item><item><title><![CDATA[ZOJ 3662 Math Magic]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/82730500</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/82730500</guid><author>baymax520</author><pubDate>Sun, 16 Sep 2018 22:27:18 +0800</pubDate><description><![CDATA[
			Math Magic

			Time Limit:  3 Seconds      Memory Limit:  32768 KB

			Yesterday, my teacher taught us about math: +, -, *, /, GCD, LCM... As you know, LCM (Least common multiple) of two positive ...]]></description><category></category></item><item><title><![CDATA[ZOJ 3623 Battle Ships]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/82730438</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/82730438</guid><author>baymax520</author><pubDate>Sun, 16 Sep 2018 22:19:50 +0800</pubDate><description><![CDATA[
			Battle Ships

			Time Limit:  2 Seconds      Memory Limit:  65536 KB

			Battle Ships is a new game which is similar to Star Craft. In this game, the enemy builds a defense tower, which has L long...]]></description><category></category></item><item><title><![CDATA[POJ 2063 Investment]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/82730389</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/82730389</guid><author>baymax520</author><pubDate>Sun, 16 Sep 2018 22:13:42 +0800</pubDate><description><![CDATA[Investment

Time Limit: 1000MS
			 
			Memory Limit: 30000K
		Total Submissions: 12098
			 
			Accepted: 4207
		Description

John never knew he had a grand-uncle, until he received the notary's letter...]]></description><category></category></item><item><title><![CDATA[POJ 1787 Charlie's Change（完全背包+物品计数+记录路径）]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/82730358</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/82730358</guid><author>baymax520</author><pubDate>Sun, 16 Sep 2018 22:09:33 +0800</pubDate><description><![CDATA[Charlie's Change

Time Limit: 1000MS
			 
			Memory Limit: 30000K
		Total Submissions: 5108
			 
			Accepted: 1620
		Description

Charlie is a driver of Advanced Cargo Movement, Ltd. Charlie drives a ...]]></description><category></category></item><item><title><![CDATA[ACM-ICPC 2018 焦作赛区网络预赛 B.Mathematical Curse]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/82719543</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/82719543</guid><author>baymax520</author><pubDate>Sun, 16 Sep 2018 00:34:31 +0800</pubDate><description><![CDATA[A prince of the Science Continent was imprisoned in a castle because of his contempt for mathematics when he was young, and was entangled in some mathematical curses. He studied hard until he reached ...]]></description><category></category></item><item><title><![CDATA[ACM-ICPC 2018 焦作赛区网络预赛 K.Transport Ship（01背包）]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/82719454</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/82719454</guid><author>baymax520</author><pubDate>Sun, 16 Sep 2018 00:28:19 +0800</pubDate><description><![CDATA[There are NN different kinds of transport ships on the port. The i^{th}ith kind of ship can carry the weight of V[i]V[i] and the number of the i^{th}ith kind of ship is 2^{C[i]} - 12C[i]−1. How many d...]]></description><category></category></item><item><title><![CDATA[POJ 3181 Dollar Dayz（完全背包）]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/82670768</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/82670768</guid><author>baymax520</author><pubDate>Thu, 13 Sep 2018 00:21:43 +0800</pubDate><description><![CDATA[Dollar Dayz

Time Limit: 1000MS
			 
			Memory Limit: 65536K
		Total Submissions: 2275
			 
			Accepted: 934
		Description

Farmer John goes to Dollar Days at The Cow Store and discovers an unlimited ...]]></description><category></category></item><item><title><![CDATA[HDU 2126 Buy the souvenirs（01背包）]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/82670402</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/82670402</guid><author>baymax520</author><pubDate>Wed, 12 Sep 2018 23:40:09 +0800</pubDate><description><![CDATA[
			Buy the souvenirs
			Time Limit: 10000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
			Total Submission(s): 3228    Accepted Submission(s): 1247
			 
			Problem Description
	...]]></description><category></category></item><item><title><![CDATA[UVA 674 Coin Change（完全背包）]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/82670324</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/82670324</guid><author>baymax520</author><pubDate>Wed, 12 Sep 2018 23:32:54 +0800</pubDate><description><![CDATA[UVA 674  Coin Change  解题报告

题目链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=87730#problem/E

题目：

Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want ...]]></description><category></category></item><item><title><![CDATA[2018 南京网络邀请赛 E. AC Challenge]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/82669073</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/82669073</guid><author>baymax520</author><pubDate>Wed, 12 Sep 2018 21:59:15 +0800</pubDate><description><![CDATA[Dlsj is competing in a contest with n (0 &amp;lt; n \le 20)n(0&amp;lt;n≤20) problems. And he knows the answer of all of these problems.

However, he can submit ii-th problem if and only if he has submitted (a...]]></description><category></category></item><item><title><![CDATA[ZOJ 3469 Food Delivery（区间dp）]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/82432075</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/82432075</guid><author>baymax520</author><pubDate>Wed, 05 Sep 2018 22:46:46 +0800</pubDate><description><![CDATA[Food Delivery

Time Limit: 2 Seconds      Memory Limit: 65536 KB

When we are focusing on solving problems, we usually prefer to stay in front of computers rather than go out for lunch. At this time, ...]]></description><category></category></item><item><title><![CDATA[CF 149 D Coloring Brackets（区间dp）]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/82390073</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/82390073</guid><author>baymax520</author><pubDate>Tue, 04 Sep 2018 20:55:36 +0800</pubDate><description><![CDATA[D. Coloring Brackets

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Once Petya read a problem about a bracket sequence. He gave ...]]></description><category></category></item><item><title><![CDATA[POJ 2955 Brackets（区间dp）]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/82357029</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/82357029</guid><author>baymax520</author><pubDate>Tue, 04 Sep 2018 00:18:20 +0800</pubDate><description><![CDATA[Brackets

Time Limit: 1000MS
			 
			Memory Limit: 65536K
		Total Submissions: 12328
			 
			Accepted: 6538
		Description

We give the following inductive definition of a “regular brackets” sequence:
...]]></description><category></category></item><item><title><![CDATA[HDU 1247 Hat’s Words（字典树）]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/82024536</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/82024536</guid><author>baymax520</author><pubDate>Fri, 24 Aug 2018 19:46:19 +0800</pubDate><description><![CDATA[
			Hat’s Words
			Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
			Total Submission(s): 19043    Accepted Submission(s): 6722
			 
			Problem Description

			A h...]]></description><category></category></item><item><title><![CDATA[HDU 1671 Phone List（字典树）]]></title><link>https://blog.youkuaiyun.com/baymax520/article/details/82023651</link><guid>https://blog.youkuaiyun.com/baymax520/article/details/82023651</guid><author>baymax520</author><pubDate>Fri, 24 Aug 2018 18:13:57 +0800</pubDate><description><![CDATA[
			Phone List
			Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
			Total Submission(s): 25761    Accepted Submission(s): 8610
			 
			Problem Description

			Give...]]></description><category></category></item></channel></rss>