<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Chihiro1231的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Chihiro1231</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Chihiro1231]]></copyright><item><title><![CDATA[dp求最长回文字串leetcode#5]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363722</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363722</guid><author>Chihiro1231</author><pubDate>Sat, 15 Oct 2016 20:50:00 +0800</pubDate><description><![CDATA[状态转移方程:
p[i][i] = 1;p[i] = p[i+1] = 1(if s[i]=s[i+1])
p[i][j] = 1(if p[i+1][j-1]&amp;&amp;s[i]=s[j])


转载于:https://www.cnblogs.com/EdsonLin/p/5965289.html]]></description><category></category></item><item><title><![CDATA[zjgsu第五场解题报告]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363736</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363736</guid><author>Chihiro1231</author><pubDate>Wed, 03 Aug 2016 20:32:00 +0800</pubDate><description><![CDATA[A.hdu1003Max Sum
dp求最大序列和
dp[i] = max(dp[i-1],0)+a[i] ps.dp[i]当前元素结尾的最大序列和
mmax = max(mmax,dp[i])
讲的不清楚，可以看看别人的思路
http://alorry.blog.163.com/blog/static/6472570820123801223397/


#in...]]></description><category></category></item><item><title><![CDATA[Project Euler 26-50]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363730</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363730</guid><author>Chihiro1231</author><pubDate>Fri, 29 Jul 2016 02:25:00 +0800</pubDate><description><![CDATA[A.Reciprocal cycles
求小数循环节的方法


#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cstring&gt;
#include &lt;string&gt;

using namespace std;

const int MAXN = 1e4+100;
int...]]></description><category></category></item><item><title><![CDATA[graph theory:]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363725</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363725</guid><author>Chihiro1231</author><pubDate>Thu, 28 Jul 2016 02:50:00 +0800</pubDate><description><![CDATA[Floyd : City of Blinding Lights
重点距离为0
平时都不用floy,一到用时，竟然写不来。。。


#include &lt;cstdio&gt;
#include &lt;iostream&gt;
#include &lt;string&gt;
#include &lt;cstring&gt;
#include &lt;algorith...]]></description><category></category></item><item><title><![CDATA[codeforces#688B  Lovely Palindromes]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363719</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363719</guid><author>Chihiro1231</author><pubDate>Mon, 25 Jul 2016 18:58:00 +0800</pubDate><description><![CDATA[http://codeforces.com/problemset/problem/688/B
5k人以上做出来的大水题，题目还是非常有爱的，找规律，发现2-digit有9个，4-digit有90个，然后就是900，9000的序列
题目要求最k个序列是什么，比如980个，必然是是在3-gidit内(980&lt;999)
这个序列有一个规律，第(k)个回文长度必然是2*(k的位数)，...]]></description><category></category></item><item><title><![CDATA[Project Euler 1-25]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363727</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363727</guid><author>Chihiro1231</author><pubDate>Mon, 25 Jul 2016 01:02:00 +0800</pubDate><description><![CDATA[A. Multiples of 3 and 5
大水题，计算出below n内是3，5倍数的总和
数据较大，只能用求和公式


#include &lt;iostream&gt;
#include &lt;cstdio&gt;
typedef long long ll;
using namespace std;

int main()
{
    int T;
...]]></description><category></category></item><item><title><![CDATA[BestCoder Round #84]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363726</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363726</guid><author>Chihiro1231</author><pubDate>Sun, 24 Jul 2016 14:51:00 +0800</pubDate><description><![CDATA[A.贪心
B.b题我昨晚看两个队友都没写出来，早上看觉得挺简单的，天真以为是要以ai结尾的连续的，wa1...然后知道是可以不连续的，做着做着忘了是要以ai结尾的，以为是前面的子序列最长就可以了，wa4...
其实如果了解O(nlogn)的算法就可以很快想出来了，亏我还是写过模板的人，各种wa我也是醉了，每次只要在找到当前数字在LIS数组上的位置就可以了
题目还是挺好的，我发现题目...]]></description><category></category></item><item><title><![CDATA[codeforces#689BMike and Shortcuts]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363717</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363717</guid><author>Chihiro1231</author><pubDate>Sun, 24 Jul 2016 01:55:00 +0800</pubDate><description><![CDATA[最近忙于写题和被虐，还有懒，好久没有更新博客了，昨天被虐了一整天，整个人都是迷茫状态，好好补cf吧
发现挺有意思的
这题就是cur点可以到cur-1，cur+1，a[cur]三个位置，求最短路径问题
题目数据量较大，当时没想到可以用bfs，也是好久没有用纯搜索了，时间复杂度不会算呀，我以为会超的orz
所以妥妥去想dp，然后没用想到题目可以往回走，妥妥wa，今天下午也是这样，wa...]]></description><category></category></item><item><title><![CDATA[POJ2985 并查集+线段树 求第k大的数]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363589</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363589</guid><author>Chihiro1231</author><pubDate>Tue, 05 Jul 2016 15:21:00 +0800</pubDate><description><![CDATA[其实这题之前做过，线段树一直不熟，所以也一直没有搞懂
本题的关键是线段树原始区间代表的是每一种容器(size不同)的数量
比如 刚开始都是互不相关的，所以1的容器有n个 2 3 4。。。为0个
线段树每个结点的附加信息是该区间的和
本题查找出的代码是关键 比如左右子树分别为sum 27 25 ，则第26大的容器必然在左子树上，继续递归下去，则要在该左子树找 (26-25)大的容器...]]></description><category></category></item><item><title><![CDATA[Trie树模板 POJ1056]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363585</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363585</guid><author>Chihiro1231</author><pubDate>Tue, 05 Jul 2016 15:04:00 +0800</pubDate><description><![CDATA[IMMEDIATE DECODABILITY




Time Limit:1000MS

Memory Limit:10000K


Total Submissions:12907

Accepted:6188




Description
An encoding of a set of symbols is said to be im...]]></description><category></category></item><item><title><![CDATA[hdu1863最小生成树krus模板&prim模板]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363714</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363714</guid><author>Chihiro1231</author><pubDate>Wed, 15 Jun 2016 01:23:00 +0800</pubDate><description><![CDATA[最小生成树的定义:权值和最小的连通路
krus:每一步寻找原图最短路径(但是要安全边)加入 判断安全边可以用并查集


#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;
#in...]]></description><category></category></item><item><title><![CDATA[hdu 3870 最小割转化为最短路径2]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363723</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363723</guid><author>Chihiro1231</author><pubDate>Fri, 10 Jun 2016 18:36:00 +0800</pubDate><description><![CDATA[Catch the Theves
Problem Description
A group of thieves is approaching a museum in the country of zjsxzy,now they are in city A,and the museum is in city B,where keeps many broken legs of zjsxz...]]></description><category></category></item><item><title><![CDATA[UVALive 3661 最小割转化为最短路径]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363712</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363712</guid><author>Chihiro1231</author><pubDate>Fri, 10 Jun 2016 18:26:00 +0800</pubDate><description><![CDATA[题意：动物逃跑，从左上跑到右下角，逃跑的路径是一个grid的边，现在动物园的工作人员要去拦截。input给出了grid每条路径拦截所需要的cost，题目要求拦截成功最小的成本。
经典的最小割问题，但是400*400个点太大了，所以不能直接这么做
lrj给出的方法是动物要从左上跑到右下，所有我们考虑怎么摆障碍物就可以了，思考可以知道，只要做左/下-&gt;右/上的连续拦截边，就可以将所...]]></description><category></category></item><item><title><![CDATA[UVA 1078 dij模板 +建图难]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363720</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363720</guid><author>Chihiro1231</author><pubDate>Fri, 10 Jun 2016 15:04:00 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;
#include &lt;stack&gt;
#include &lt;string&gt;
#include &lt;q...]]></description><category></category></item><item><title><![CDATA[自用新工程模板]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363710</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363710</guid><author>Chihiro1231</author><pubDate>Thu, 26 May 2016 21:17:00 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;
#include &lt;stack&gt;
#include &lt;string&gt;
#include &lt;q...]]></description><category></category></item><item><title><![CDATA[UVA 11478 bf+差分约束系统+二分逼近]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363718</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363718</guid><author>Chihiro1231</author><pubDate>Tue, 24 May 2016 18:33:00 +0800</pubDate><description><![CDATA[Halum
You are given a directed graph G(V, E) with a set of vertices and edges. Each edge (i, j) that connects some vertex i to vertex j has an integer cost associated with that edge. Define the ...]]></description><category></category></item><item><title><![CDATA[UVA11090 二分逼近+bf]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363715</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363715</guid><author>Chihiro1231</author><pubDate>Mon, 23 May 2016 20:55:00 +0800</pubDate><description><![CDATA[Going in Cycle!!
You are given a weighted directed graph with n vertices and m edges. Each cycle in the graph has a weight, which equals to sum of its edges. There are so many cycles in the grap...]]></description><category></category></item><item><title><![CDATA[2016"百度之星" - 初赛（Astar Round2B）]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363707</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363707</guid><author>Chihiro1231</author><pubDate>Sun, 22 May 2016 23:49:00 +0800</pubDate><description><![CDATA[1003.杨辉三角+逆元


#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;
#include &lt;stack&gt;
#include &lt;string&gt;
...]]></description><category></category></item><item><title><![CDATA[2016年团体程序设计天梯赛-模拟赛]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363713</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363713</guid><author>Chihiro1231</author><pubDate>Mon, 16 May 2016 00:04:00 +0800</pubDate><description><![CDATA[L2-1. 集合相似度
stl set模板,以后复习可以看一下，当模板用了，去重很有用呀


#include &lt;cstdio&gt;
#include &lt;set&gt;
using namespace std;
set&lt;int&gt; s[50];
int main(){
    //freopen("G:\\input.in", "r", stdi...]]></description><category></category></item><item><title><![CDATA[2016百度之星资格赛]]></title><link>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363705</link><guid>https://blog.youkuaiyun.com/Chihiro1231/article/details/101363705</guid><author>Chihiro1231</author><pubDate>Sat, 14 May 2016 21:51:00 +0800</pubDate><description><![CDATA[A.前缀hash+逆元


#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;
#include &lt;stack&gt;
#include &lt;string&gt;
#...]]></description><category></category></item></channel></rss>