<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[four_knife的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/four_knife</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; four_knife]]></copyright><item><title><![CDATA[北京邀请赛]]></title><link>https://blog.youkuaiyun.com/four_knife/article/details/39033117</link><guid>https://blog.youkuaiyun.com/four_knife/article/details/39033117</guid><author>four_knife</author><pubDate>Sun, 07 Sep 2014 12:22:12 +0800</pubDate><description><![CDATA[B.Beautiful Garden
题目：所有树排在xz]]></description><category></category></item><item><title><![CDATA[poj1939(计算几何）]]></title><link>https://blog.youkuaiyun.com/four_knife/article/details/26573229</link><guid>https://blog.youkuaiyun.com/four_knife/article/details/26573229</guid><author>four_knife</author><pubDate>Thu, 22 May 2014 11:44:44 +0800</pubDate><description><![CDATA[题意：在宽度为1的管里射条光线最远射duo cha g]]></description><category></category></item><item><title><![CDATA[poj2031(最小生成树）]]></title><link>https://blog.youkuaiyun.com/four_knife/article/details/26505549</link><guid>https://blog.youkuaiyun.com/four_knife/article/details/26505549</guid><author>four_knife</author><pubDate>Wed, 21 May 2014 20:23:44 +0800</pubDate><description><![CDATA[题意：给若干三为坐标的点，]]></description><category></category></item><item><title><![CDATA[poj1905（计算几何＋二分）]]></title><link>https://blog.youkuaiyun.com/four_knife/article/details/26102927</link><guid>https://blog.youkuaiyun.com/four_knife/article/details/26102927</guid><author>four_knife</author><pubDate>Sat, 17 May 2014 23:13:16 +0800</pubDate><description><![CDATA[题目：有一条金属条，长度为l，受热会膨胀变长，但两边固定，suo yi]]></description><category></category></item><item><title><![CDATA[poj1950(dfs)]]></title><link>https://blog.youkuaiyun.com/four_knife/article/details/26020907</link><guid>https://blog.youkuaiyun.com/four_knife/article/details/26020907</guid><author>four_knife</author><pubDate>Sat, 17 May 2014 00:39:30 +0800</pubDate><description><![CDATA[题意：给你yi ge shu]]></description><category></category></item><item><title><![CDATA[poj3258(二分）]]></title><link>https://blog.youkuaiyun.com/four_knife/article/details/26005717</link><guid>https://blog.youkuaiyun.com/four_knife/article/details/26005717</guid><author>four_knife</author><pubDate>Fri, 16 May 2014 19:50:10 +0800</pubDate><description><![CDATA[题意：一条长度为L得河道，有除了终点起点外有两颗shi zin个石子，]]></description><category></category></item><item><title><![CDATA[poj3273（二分）]]></title><link>https://blog.youkuaiyun.com/four_knife/article/details/25981453</link><guid>https://blog.youkuaiyun.com/four_knife/article/details/25981453</guid><author>four_knife</author><pubDate>Fri, 16 May 2014 15:26:17 +0800</pubDate><description><![CDATA[http://poj.org/problem?id=3273
题意：]]></description><category></category></item><item><title><![CDATA[poj1201（图论）]]></title><link>https://blog.youkuaiyun.com/four_knife/article/details/24600851</link><guid>https://blog.youkuaiyun.com/four_knife/article/details/24600851</guid><author>four_knife</author><pubDate>Sun, 27 Apr 2014 21:03:28 +0800</pubDate><description><![CDATA[poj1201
题意：给定闭区间［]]></description><category></category></item><item><title><![CDATA[poj3393(模拟）]]></title><link>https://blog.youkuaiyun.com/four_knife/article/details/23753645</link><guid>https://blog.youkuaiyun.com/four_knife/article/details/23753645</guid><author>four_knife</author><pubDate>Tue, 15 Apr 2014 13:25:52 +0800</pubDate><description><![CDATA[题意：好长。。。给出一个时间段，问在这个时间段zho]]></description><category></category></item><item><title><![CDATA[poj3007(模拟）]]></title><link>https://blog.youkuaiyun.com/four_knife/article/details/23614109</link><guid>https://blog.youkuaiyun.com/four_knife/article/details/23614109</guid><author>four_knife</author><pubDate>Sun, 13 Apr 2014 19:36:18 +0800</pubDate><description><![CDATA[题意：给出一个字符s，可以分割成两个字符s1和是s3，]]></description><category></category></item><item><title><![CDATA[poj3096（模拟）]]></title><link>https://blog.youkuaiyun.com/four_knife/article/details/23396859</link><guid>https://blog.youkuaiyun.com/four_knife/article/details/23396859</guid><author>four_knife</author><pubDate>Fri, 11 Apr 2014 00:01:57 +0800</pubDate><description><![CDATA[题目：D-pairs称为特殊字符，即给出一串字符判断]]></description><category></category></item><item><title><![CDATA[HFUT&#38;AHU组团训练(一)----DP专题]]></title><link>https://blog.youkuaiyun.com/four_knife/article/details/21892499</link><guid>https://blog.youkuaiyun.com/four_knife/article/details/21892499</guid><author>four_knife</author><pubDate>Mon, 24 Mar 2014 00:36:43 +0800</pubDate><description><![CDATA[网址：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=42394#overview
密码：akak
A题：
题意：求两个字符串的最长公共子串，特别的是，这个子串的每块连续的部分必须大于等于题目所给的k。
思路：第一遍打时完全时一片浆糊，采用常规方法，各种细节没有考虑到，果断删了重打。既然段都要求>=k，那么我一次就先找那连续的长度]]></description><category></category></item><item><title><![CDATA[线段树专题]]></title><link>https://blog.youkuaiyun.com/four_knife/article/details/19683327</link><guid>https://blog.youkuaiyun.com/four_knife/article/details/19683327</guid><author>four_knife</author><pubDate>Tue, 25 Feb 2014 20:46:59 +0800</pubDate><description><![CDATA[hdu1166  http://acm.hdu.edu.cn/showproblem.php?pid=1166#include

#define lson l, m, rt << 1
#define rson m+1, r, rt <<1 | 1

const int maxn = 55555;
int sum[maxn << 2];

void pushup(int rt){
    sum[r]]></description><category></category></item><item><title><![CDATA[线段树——poj1823]]></title><link>https://blog.youkuaiyun.com/four_knife/article/details/19359731</link><guid>https://blog.youkuaiyun.com/four_knife/article/details/19359731</guid><author>four_knife</author><pubDate>Mon, 17 Feb 2014 22:33:55 +0800</pubDate><description><![CDATA[题目：http://poj.org/problem?id=1823
大意是住宾馆，有三种操作，1是从第i个房间要连续入住m个人;2是从第i个房间要连续退房i个人;3是查询最大连续空房间数
很简单的线段树
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
im]]></description><category></category></item><item><title><![CDATA[HFUT 寒假训练1 by luis16suarez]]></title><link>https://blog.youkuaiyun.com/four_knife/article/details/18418953</link><guid>https://blog.youkuaiyun.com/four_knife/article/details/18418953</guid><author>four_knife</author><pubDate>Fri, 17 Jan 2014 21:38:09 +0800</pubDate><description><![CDATA[http://acm.hust.edu.cn/vjudge/contest/view.action?cid=39625#overview

A
#include
#include
#include
#include
using namespace std;

bool f(long long a){
    long long sum = 0;
    while(a != 0){
    ]]></description><category></category></item><item><title><![CDATA[2014.01.15]]></title><link>https://blog.youkuaiyun.com/four_knife/article/details/18320035</link><guid>https://blog.youkuaiyun.com/four_knife/article/details/18320035</guid><author>four_knife</author><pubDate>Wed, 15 Jan 2014 22:23:43 +0800</pubDate><description><![CDATA[网址：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=39485#overview
A
题意：看有多少个str字符串里有全部[0,k]个数字
水~
#include
#include
#include
using namespace std;

int main(){
    int n,k;
    string str;

 ]]></description><category></category></item><item><title><![CDATA[AHU_ACM_2014（个人积分赛第三场）]]></title><link>https://blog.youkuaiyun.com/four_knife/article/details/17400803</link><guid>https://blog.youkuaiyun.com/four_knife/article/details/17400803</guid><author>four_knife</author><pubDate>Wed, 18 Dec 2013 20:56:43 +0800</pubDate><description><![CDATA[1.poj1306/Combination
题意：计算组合数，利用C(n,m)=C(n-1,m-1)+C(n-1,m)公式计算。（C（n,0) = 1!!!) 先打表，计算所有的值，然后查表得到。水题
#include
using namespace std;

int main(){
    __int64 c[101][101] = {0};
    for (int i = 1; i <]]></description><category></category></item></channel></rss>