<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[TXT003的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/TXT003</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; TXT003]]></copyright><item><title><![CDATA[新博客地址]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/51723008</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/51723008</guid><author>TXT003</author><pubDate>Mon, 20 Jun 2016 19:56:40 +0800</pubDate><description><![CDATA[http://aiterator.cn]]></description><category></category></item><item><title><![CDATA[Poj 3468 A Simple Problem with Integers(树状数组&&线段树）]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/51674363</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/51674363</guid><author>TXT003</author><pubDate>Tue, 14 Jun 2016 21:16:09 +0800</pubDate><description><![CDATA[代码如下：
#include
#include
#include
using namespace std;

typedef long long ll;
const ll N = 100007;
ll a[N], b[N], c[N];

void add(ll s[], ll i, ll x, ll n)
{
    while(i <= n)
    {
        s[i] += x;]]></description><category></category></item><item><title><![CDATA[Light OJ 1033 - Generating Palindromes]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/51660752</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/51660752</guid><author>TXT003</author><pubDate>Mon, 13 Jun 2016 21:30:00 +0800</pubDate><description><![CDATA[题目大意：
给你一个字符串，问最少添加多少个字符，使原字符串变成回文串
思路：
回文串的性质是倒过来两者一样， 那么有这个性质可知， 设原始字符串为a，原始字符串颠倒过来的字符串为b，  那么求a和b的最长公共子序列， 字符串a的长度减去最长公共自序列的长度不就是最少添加的字符！
代码如下：
#include 
using namespace std;
typedef long long]]></description><category></category></item><item><title><![CDATA[Light OJ 1047 Neighbor House]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/51660435</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/51660435</guid><author>TXT003</author><pubDate>Mon, 13 Jun 2016 20:37:42 +0800</pubDate><description><![CDATA[题目大意：
给你nx3的矩阵， 每行选一个数， 相邻的行不能选同一列的数，问选取数的最小和是多少？
定义dp[i][j]为第i行选取第j个数的最小和
那么状态转移方程不就是dp[i][j] = min(dp[i][j], dp[i-1][k] + mp[i][j])
代码如下：
#include 
using namespace std;
typedef long long ll;
co]]></description><category></category></item><item><title><![CDATA[Light OJ 1013 Love Calculator]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/51648328</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/51648328</guid><author>TXT003</author><pubDate>Mon, 13 Jun 2016 09:17:30 +0800</pubDate><description><![CDATA[题目大意：
给你两个字符串a， b，问存在多少个这样的字符串。这样的字符串是指字符串a和字符串b都是该字符串的子串， 且这样的字符串要求长度最小。
输出这样的字符串的长度和存在多少个]]></description><category></category></item><item><title><![CDATA[LightOJ 1011 Marriage Ceremonies]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/51589451</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/51589451</guid><author>TXT003</author><pubDate>Sun, 05 Jun 2016 15:06:40 +0800</pubDate><description><![CDATA[题目大意：
n对男女，现在要求将他们配对， 给你nxn的矩阵， 第i行第j列表示， 第i个男生和第j个女生配对的优先指数， 将n对男女全部配对的最大优先指数


参考题解：http://blog.youkuaiyun.com/guard_mine/article/details/46386421


定义dp[i][j] 表示第i个男生，状态为j时的最大值


#include 
usin]]></description><category></category></item><item><title><![CDATA[匈牙利匹配 fzuoj 2232 炉石传说]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/51503230</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/51503230</guid><author>TXT003</author><pubDate>Thu, 26 May 2016 00:25:47 +0800</pubDate><description><![CDATA[Problem Description
在简化版的炉石传说中：
每个随从只有生命值和攻击力，并且在你的回合下，你的每只随从在本回合下只能选择一个敌方随从进行攻击。当两个随从a，b交战时，a的生命值将减去b的攻击力，b的生命值将减去a的攻击力，（两个伤害没有先后顺序，同时结算）。如果a或b的生命值不大于0，该随从将死亡。
某一次对局中，GG学长和对手场面上均有n个随从，并且是GG学长的回合。由]]></description><category></category></item><item><title><![CDATA[python爬虫]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/51460295</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/51460295</guid><author>TXT003</author><pubDate>Fri, 20 May 2016 11:24:59 +0800</pubDate><description><![CDATA[经过一周的尝试，终于把一个能够一直爬取网页的爬虫写出来了。
 
写爬虫之前，要先确定爬虫的结构，在进行模块化的编写；
一个简单爬虫需要什么?  
需要把网页下载下来， 需要把网页中的数据解析出来， 需要把网页内部的链接加入到待爬取的队列中， 然后把数据储存下来！
确定了需要的东西，我们就可以开始编写爬虫了；
首先定义四个模块，DataStore
由于我将url和data全部在数据库中]]></description><category></category></item><item><title><![CDATA[poj 3190 Stall Reservations]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/50454955</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/50454955</guid><author>TXT003</author><pubDate>Tue, 26 Apr 2016 09:12:07 +0800</pubDate><description><![CDATA[题目链接：http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=39459]]></description><category></category></item><item><title><![CDATA[矩阵快速幂 - hduoj 5667 Sequence  -nyoj 301 递推求值]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/51246015</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/51246015</guid><author>TXT003</author><pubDate>Tue, 26 Apr 2016 08:54:12 +0800</pubDate><description><![CDATA[nyoj： 301：

给你一个递推公式：

f(x)=a*f(x-2)+b*f(x-1)+c

并给你f(1),f(2)的值，请求出f(n)的值，由于f(n)的值可能过大，求出f(n)对1000007取模后的值。

输入数据有f(1),f(2),a,b,c,n求f(n)对1e9+7取余的值；

由于n的范围很大，所以此时就需要把递推式变成矩阵的形式；




所以直]]></description><category></category></item><item><title><![CDATA[素数筛选--总结]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/50985897</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/50985897</guid><author>TXT003</author><pubDate>Sat, 26 Mar 2016 12:06:34 +0800</pubDate><description><![CDATA[第一种：直接暴力，在这就不说了
第二种：埃氏筛法（能处理1e6以下的数据）
首先，将2到n范围内的所有整数写下来。其中最小的素数为2，将表中所有2的倍数都划去。表中剩余的最小数字是3，不能被更小的数整除，所以也是素数，将表中所有3的倍数也划去。。。 依此类推，如果表中剩余的最小数字为m时，m就是素数，再将m的所有倍数划去。
代码如下：
int prime[100007], s = 0;
b]]></description><category></category></item><item><title><![CDATA[NOJ 1656 搬砖]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/50890597</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/50890597</guid><author>TXT003</author><pubDate>Mon, 14 Mar 2016 22:51:51 +0800</pubDate><description><![CDATA[问题描述

开学了，万恶的大二学长们又要领着大一的鲜肉们一起敲代码搬砖了，这不，著名的杨神拿着n块砖头，当然他把这n块砖头的重量都告诉你了，让你搬走其中的2＊k块，其中每次你只能拿2块，消耗的体力是这两块砖头重量之差的平方，比如一块砖重量为5，另一块是11，那么搬走这两块砖头消耗体力为(11- 5)^2 = 36，机智如你，你能算出如何搬2*k块，才能使你花费的体力最小呢？


输入
]]></description><category></category></item><item><title><![CDATA[算法分析——归并排序]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/50668463</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/50668463</guid><author>TXT003</author><pubDate>Mon, 15 Feb 2016 15:08:00 +0800</pubDate><description><![CDATA[算法分析：归并排序
刚刚看了网易公开课上的算法导论的第一节，讲的是插入排序和归并排序。
插入排序很简单
双重循环，第一层循环i从1到n，第二层循环j从0到i，将元素插入的0到i已经排好序的序列中正确的位置，这就是插入排序。
时间复杂度的最坏情况是1+2+3+4+···+n也就是n*(n+1)/2,最后时间复杂度就是n^2.
归并排序感触颇深，想详细总结一下
对于一个有n个元素的数组（1]]></description><category></category></item><item><title><![CDATA[python字符串函数]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/50522518</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/50522518</guid><author>TXT003</author><pubDate>Fri, 15 Jan 2016 11:27:04 +0800</pubDate><description><![CDATA[python大小写转换函数：
1: capitalize()  #字符串首字母大写，其余全部小写
2: lower()  #字符串全部小写
3: upper()  #字符串全部大写
4: title()  #字符串中每个单词首字母大写，其余小写
5: def UpperFirstWord(str):
         return str[0].upper + str[1:]    #]]></description><category></category></item><item><title><![CDATA[杭电 5592 ZYB's Premutation（线段树求第k大数）]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/50286065</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/50286065</guid><author>TXT003</author><pubDate>Sun, 13 Dec 2015 20:35:31 +0800</pubDate><description><![CDATA[线段树求第k大数]]></description><category></category></item><item><title><![CDATA[hdu 4325 Flowers]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/49838011</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/49838011</guid><author>TXT003</author><pubDate>Sat, 14 Nov 2015 19:21:26 +0800</pubDate><description><![CDATA[Problem Description
As is known to all, the blooming time and duration varies between different kinds of flowers. Now there is a garden planted full of flowers. The gardener wants to know how many fl]]></description><category></category></item><item><title><![CDATA[hdu 1541 Stars]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/49765405</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/49765405</guid><author>TXT003</author><pubDate>Tue, 10 Nov 2015 21:10:19 +0800</pubDate><description><![CDATA[Problem Description
Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars tha]]></description><category></category></item><item><title><![CDATA[HDU 5124 lines]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/49704961</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/49704961</guid><author>TXT003</author><pubDate>Sat, 07 Nov 2015 20:20:40 +0800</pubDate><description><![CDATA[Problem Description
John has several lines. The lines are covered on the X axis. Let A is a point which is covered by the most lines. John wants to know how many lines cover A.
 

Input
The first]]></description><category></category></item><item><title><![CDATA[2015 CCPC D题]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/49701283</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/49701283</guid><author>TXT003</author><pubDate>Sat, 07 Nov 2015 13:07:05 +0800</pubDate><description><![CDATA[Pick The Sticks 



Time Limit: 15000/10000MS (Java/Others)     Memory Limit: 65535/65535KB (Java/Others)






The story happened long long ago. One day, Cao Cao made a special order calle]]></description><category></category></item><item><title><![CDATA[2015 CCPC C题（超时代码）]]></title><link>https://blog.youkuaiyun.com/TXT003/article/details/49701241</link><guid>https://blog.youkuaiyun.com/TXT003/article/details/49701241</guid><author>TXT003</author><pubDate>Sat, 07 Nov 2015 12:55:27 +0800</pubDate><description><![CDATA[The Battle of Chibi 



Time Limit: 6000/4000MS (Java/Others)     Memory Limit: 65535/65535KB (Java/Others)






Cao Cao made up a big army and was going to invade the whole South China. Y]]></description><category></category></item></channel></rss>