<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Pleaseinput的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Pleaseinput</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Pleaseinput]]></copyright><item><title><![CDATA[POJ3241]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/89066936</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/89066936</guid><author>Pleaseinput</author><pubDate>Sun, 07 Apr 2019 11:23:15 +0800</pubDate><description><![CDATA[对拍了半天发现别人代码的锅。。。）

纪念一下学会曼哈顿最小生成树，虽然不是很难理解

250行的鶸代码：


#include&lt;cstdio&gt;
#include&lt;algorithm&gt;
#include&lt;queue&gt;
#include&lt;cstring&gt;
#include&lt;math.h&gt;
using namespace std;
const...]]></description><category></category></item><item><title><![CDATA[hiho字符串]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/88073741</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/88073741</guid><author>Pleaseinput</author><pubDate>Sat, 02 Mar 2019 11:32:50 +0800</pubDate><description><![CDATA[这题目有点坑啊，要求必须恰好。。。一直在wa

题目定义包含恰好两个'h'，一个'i'，一个'o'的字符串为hiho字符串，问你对于给定字符串它的子串中是hiho字符串的最短长度是多少。

尺取O(n)的算法，很容易想到，过程需要认真点。


#include&amp;lt;bits/stdc++.h&amp;gt;
using namespace std;
const int N = 1e5 + 5;
int ...]]></description><category></category></item><item><title><![CDATA[POJ2778]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/87990862</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/87990862</guid><author>Pleaseinput</author><pubDate>Wed, 27 Feb 2019 21:11:17 +0800</pubDate><description><![CDATA[刷AC自动机，很久以前做过，再系统地做一便，发现之前dp矩阵的裸体都过不了。玄学修改后就行了（板子问题？？？）

记录一下


#include&amp;lt;cstdio&amp;gt;
#include&amp;lt;cstring&amp;gt;
#include&amp;lt;queue&amp;gt;
using namespace std;
#define ll long long
int ch[105][5];
int root ...]]></description><category></category></item><item><title><![CDATA[cf round #523 C]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/84377149</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/84377149</guid><author>Pleaseinput</author><pubDate>Fri, 23 Nov 2018 10:57:26 +0800</pubDate><description><![CDATA[C. Multiplicity

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an integer array a1,a2,…,ana1,a2,…,an.

The array b...]]></description><category></category></item><item><title><![CDATA[cf round #523 B]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/84376848</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/84376848</guid><author>Pleaseinput</author><pubDate>Fri, 23 Nov 2018 10:54:09 +0800</pubDate><description><![CDATA[B. Views Matter

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You came to the exhibition and one exhibit has drawn your attenti...]]></description><category></category></item><item><title><![CDATA[codeforces Round #523   A. Coins]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/84376765</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/84376765</guid><author>Pleaseinput</author><pubDate>Fri, 23 Nov 2018 10:49:51 +0800</pubDate><description><![CDATA[codeforces Round #523 

A. Coins

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You have unlimited number of coins with values 1...]]></description><category></category></item><item><title><![CDATA[2018icpc沈阳热身赛C]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/83216028</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/83216028</guid><author>Pleaseinput</author><pubDate>Sat, 20 Oct 2018 19:16:35 +0800</pubDate><description><![CDATA[枚举当前这些数字中比第一个数字大的有多少


#include&amp;lt;bits/stdc++.h&amp;gt;
using namespace std;
typedef long long ll;
ll dp[35][1005];
ll C[35][35];
const ll mod = 1e9 + 7;

ll dfs(int n, int m)
{
    //cout &amp;lt;&amp;lt; n &amp;lt...]]></description><category></category></item><item><title><![CDATA[cf1066E Binary Numbers AND Sum]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/83036435</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/83036435</guid><author>Pleaseinput</author><pubDate>Sat, 13 Oct 2018 10:56:22 +0800</pubDate><description><![CDATA[题目：http://codeforces.com/contest/1066/problem/E

You are given two huge binary integer numbers aa and bb of lengths nn and mm respectively. You will repeat the following process: if b&amp;gt;0b&amp;gt;0, then...]]></description><category></category></item><item><title><![CDATA[1066D Boxes Packing]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/83036353</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/83036353</guid><author>Pleaseinput</author><pubDate>Sat, 13 Oct 2018 10:49:05 +0800</pubDate><description><![CDATA[题目：http://codeforces.com/contest/1066/problem/D

开始没看懂题意，后来看了note才明白。。。

Maksim has nn objects and mm boxes, each box has size exactly kk. Objects are numbered from 11 to nn in order from left to righ...]]></description><category></category></item><item><title><![CDATA[1066C  Books Queries]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/83036272</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/83036272</guid><author>Pleaseinput</author><pubDate>Sat, 13 Oct 2018 10:41:53 +0800</pubDate><description><![CDATA[题目：http://codeforces.com/contest/1066/problem/C

大意是在一个书架上放书，一共q次操作，每次操作可以把书放在最左边或最右边，要么询问把第id本书的右边的所有书或左边的所有书都清空的最小清空数量。

用一个数组表示书架位信息，l和r表示到现在最左和最右的位置。


#include&amp;lt;bits/stdc++.h&amp;gt;
using namespac...]]></description><category></category></item><item><title><![CDATA[codeforces Heaters]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/83036214</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/83036214</guid><author>Pleaseinput</author><pubDate>Sat, 13 Oct 2018 10:37:49 +0800</pubDate><description><![CDATA[题目：http://codeforces.com/contest/1066/problem/B

Vova's house is an array consisting of nn elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in s...]]></description><category></category></item><item><title><![CDATA[cf1066A Vova and Train]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/83036194</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/83036194</guid><author>Pleaseinput</author><pubDate>Sat, 13 Oct 2018 10:34:08 +0800</pubDate><description><![CDATA[题目：http://codeforces.com/problemset/problem/1066/A

作为一道div3的A，用总的灯笼数量减去被覆盖的灯笼数量就行了。

code：


#include&amp;lt;bits/stdc++.h&amp;gt;
using namespace std;
typedef long long ll;
int main()
{
    int t;
    scanf...]]></description><category></category></item><item><title><![CDATA[cf1065 C Make It Equal]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/83036105</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/83036105</guid><author>Pleaseinput</author><pubDate>Sat, 13 Oct 2018 10:30:18 +0800</pubDate><description><![CDATA[题目：http://codeforces.com/problemset/problem/1065/C

There is a toy building consisting of nn towers. Each tower consists of several cubes standing on each other. The ii-th tower consists of hihicubes,...]]></description><category></category></item><item><title><![CDATA[牛客练习赛25 D 贝利福斯数]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/82108946</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/82108946</guid><author>Pleaseinput</author><pubDate>Mon, 27 Aug 2018 10:58:53 +0800</pubDate><description><![CDATA[本来想看看oeis有没有这个数的性质，没找到。。。

题目：https://www.nowcoder.com/acm/contest/158/D

将所有形如ax+1的数称为a-贝利福斯数，其中x是正整数。
一个a-贝利福斯数是a-贝利福斯素数，当且仅当它不能被分解成两个a-贝利福斯数的积。
现在给出a,n，问有多少个 ≤ n的a-贝利福斯数可以被分解成两个a-贝利福斯素数的积。

输入描述:

...]]></description><category></category></item><item><title><![CDATA[CodeForces1010A Fly]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/81277160</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/81277160</guid><author>Pleaseinput</author><pubDate>Sun, 29 Jul 2018 23:27:25 +0800</pubDate><description><![CDATA[题目传送门:http://codeforces.com/problemset/problem/1010/A

output

standard output

Natasha is going to fly on a rocket to Mars and return to Earth. Also, on the way to Mars, she will land on n−2n−2 inter...]]></description><category></category></item><item><title><![CDATA[codeforces-1009D Relatively Prime Graph]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/81277025</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/81277025</guid><author>Pleaseinput</author><pubDate>Sun, 29 Jul 2018 23:17:03 +0800</pubDate><description><![CDATA[题目链接：http://codeforces.com/problemset/problem/1009/D

Let's call an undirected graph G=(V,E)G=(V,E) relatively prime if and only if for each edge (v,u)∈E(v,u)∈E  GCD(v,u)=1GCD(v,u)=1 (the greatest com...]]></description><category></category></item><item><title><![CDATA[HDU1358 Period]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/81275272</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/81275272</guid><author>Pleaseinput</author><pubDate>Sun, 29 Jul 2018 20:49:11 +0800</pubDate><description><![CDATA[题意：给出一个字符串S，对于每一个0到N的i，要求找一个最大的k，满足S的长度为i的前缀，可以写成一个循环节整好循环k次，对于每一个符合条件的i和k，输出i和k。

刚刚做了循环节，拿这题来练手，关于循环节的计算方法，请点击传送门。

AC代码：


#include&amp;lt;bits/stdc++.h&amp;gt;
using namespace std;
const int M = 1e6+5;
ch...]]></description><category></category></item><item><title><![CDATA[HDU3746 Cyclic Necklace]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/81274551</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/81274551</guid><author>Pleaseinput</author><pubDate>Sun, 29 Jul 2018 20:27:06 +0800</pubDate><description><![CDATA[本篇博客来自于：https://blog.youkuaiyun.com/niushuai666/article/details/6965517

首先改了一下题目名称，貌似necklace拼写错误。。。

好了说正经的。题意：T组数据，每组数据给出一个字符串，询问至少要再加多少个字符使其变成一个有循环循环至少一次的字符串。

传送：http://acm.hdu.edu.cn/showproblem.php?p...]]></description><category></category></item><item><title><![CDATA[POJ3167]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/81269834</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/81269834</guid><author>Pleaseinput</author><pubDate>Sun, 29 Jul 2018 12:14:45 +0800</pubDate><description><![CDATA[KMP上跑浮动的模式串

一个农场主有N头牛，每个牛都以它身上的斑点数作为标志，以斑点数作为标准对牛进行rank排序，定义牛的序列的相同性为第i头牛及其之前的牛的比他rank小的数量和与他rank相同的数量，比如：

1 4 4 3 2 1 和 2 10 10 7 3 2 是一样的模式串

要求数有多少个符合要求的模式串，并输出每个符合要求的子串的起始位置。

 

KMP！！！太强啦，将这个浮动...]]></description><category></category></item><item><title><![CDATA[946A split]]></title><link>https://blog.youkuaiyun.com/Pleaseinput/article/details/79996902</link><guid>https://blog.youkuaiyun.com/Pleaseinput/article/details/79996902</guid><author>Pleaseinput</author><pubDate>Wed, 18 Apr 2018 21:16:14 +0800</pubDate><description><![CDATA[A. Splitstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's define a split of n as a nonincreasing sequence of positive integers, the sum of whi...]]></description><category></category></item></channel></rss>