<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Xiao_Peng]]></title><description><![CDATA[The best preparation for tomorrow is doing your best today！]]></description><link>https://blog.youkuaiyun.com/Code_Jumper</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Code_Jumper]]></copyright><item><title><![CDATA[跟大牛学习的vim设置]]></title><link>https://blog.youkuaiyun.com/Code_Jumper/article/details/7471385</link><guid>https://blog.youkuaiyun.com/Code_Jumper/article/details/7471385</guid><author>Code_Jumper</author><pubDate>Tue, 17 Apr 2012 21:59:40 +0800</pubDate><description><![CDATA[""""""""""""""""""""""""""""""""""""""""""""""
		"	Author: Xiao_Peng		     "
		"	Mail  : 466423955@qq.com	     "
		""""""""""""""""""""""""""""""""""""""""""""""





 "显示行号
set nu
 "显示命令
set showcmd]]></description><category></category></item><item><title><![CDATA[Uva 10303 How Many Trees?]]></title><link>https://blog.youkuaiyun.com/Code_Jumper/article/details/6827714</link><guid>https://blog.youkuaiyun.com/Code_Jumper/article/details/6827714</guid><author>Code_Jumper</author><pubDate>Tue, 27 Sep 2011 21:09:29 +0800</pubDate><description><![CDATA[Java + 递推公式水过，正解MS是卡特兰数AC
import java.io.*;
import java.math.*;
import java.util.*;

public class Main
{
    public static void main(]]></description><category></category></item><item><title><![CDATA[Uva 188 Perfect Hash]]></title><link>https://blog.youkuaiyun.com/Code_Jumper/article/details/6803450</link><guid>https://blog.youkuaiyun.com/Code_Jumper/article/details/6803450</guid><author>Code_Jumper</author><pubDate>Fri, 23 Sep 2011 12:04:22 +0800</pubDate><description><![CDATA[没什么好说的，模拟就ok了~~
#include
#include
#include

using namespace std;

int cmp(const void *a,const void *b)
{
    return *(int *)a - *(i]]></description><category></category></item><item><title><![CDATA[Uva 141 The spot game]]></title><link>https://blog.youkuaiyun.com/Code_Jumper/article/details/6803090</link><guid>https://blog.youkuaiyun.com/Code_Jumper/article/details/6803090</guid><author>Code_Jumper</author><pubDate>Fri, 23 Sep 2011 10:44:38 +0800</pubDate><description><![CDATA[题意：判断游戏过程中的状态是否与前面发生重复（包括旋转），数据量小，枚举模拟即可。
#include
#include

#define N 52

using namespace std;

typedef struct _Spot{
    bool che]]></description><category></category></item><item><title><![CDATA[最长公共子序列 LCS]]></title><link>https://blog.youkuaiyun.com/Code_Jumper/article/details/6710880</link><guid>https://blog.youkuaiyun.com/Code_Jumper/article/details/6710880</guid><author>Code_Jumper</author><pubDate>Tue, 23 Aug 2011 10:42:58 +0800</pubDate><description><![CDATA[最长公共子序列，英文缩写为LCS（Longest Common Subsequence）。其定义是，一个数列 S ，如果分别是两个或多个已知数列的子序列，且是所有符合此条件序列中最长的，则 S 称为已知序列的最长公共子序列。
动态规划的一个计算最长公共子序列的方法如下：
X=]]></description><category></category></item><item><title><![CDATA[POJ 3278 Catch That Cow]]></title><link>https://blog.youkuaiyun.com/Code_Jumper/article/details/6703162</link><guid>https://blog.youkuaiyun.com/Code_Jumper/article/details/6703162</guid><author>Code_Jumper</author><pubDate>Fri, 19 Aug 2011 21:25:37 +0800</pubDate><description><![CDATA[原题是The 35th ACM-ICPC Asia Regional Contest (Hangzhou)
杭州区域赛的题，杭电OJ上题目中数据应该为10的500次方，但显示的是10500所以这题很坑爹，相比POJ的这道题完全把数据降低了，暴力BFS完全没问题！

#inc]]></description><category></category></item><item><title><![CDATA[Uva 514 Rails]]></title><link>https://blog.youkuaiyun.com/Code_Jumper/article/details/6682960</link><guid>https://blog.youkuaiyun.com/Code_Jumper/article/details/6682960</guid><author>Code_Jumper</author><pubDate>Fri, 12 Aug 2011 20:29:43 +0800</pubDate><description><![CDATA[Stack基本练习题，没用STL，在Uva Status上排名第四，也是我在UVA排名最靠前的一题！
#include
#include

#define MAXN 1010

int main()
{
    int n,target[MAXN],i,j,k,t]]></description><category></category></item><item><title><![CDATA[Uva 539 The Settlers of Catan]]></title><link>https://blog.youkuaiyun.com/Code_Jumper/article/details/6682954</link><guid>https://blog.youkuaiyun.com/Code_Jumper/article/details/6682954</guid><author>Code_Jumper</author><pubDate>Fri, 12 Aug 2011 20:24:12 +0800</pubDate><description><![CDATA[在给定的点中找一条最长路，每条便只能走一次！回溯水过~~
#include
#include
#include
#include
#include
#include

using namespace std;

int vis[26][26];
int n,]]></description><category></category></item><item><title><![CDATA[Uva 216 	Getting in Line]]></title><link>https://blog.youkuaiyun.com/Code_Jumper/article/details/6682942</link><guid>https://blog.youkuaiyun.com/Code_Jumper/article/details/6682942</guid><author>Code_Jumper</author><pubDate>Fri, 12 Aug 2011 20:17:20 +0800</pubDate><description><![CDATA[枚举给定点的坐标间距离和的最小值~~数据量小，暴力枚举即可~~

#include
#include
#include
#include
#include
#include

using namespace std;

typedef struct _Poi]]></description><category></category></item><item><title><![CDATA[Uva 10344 23 out of 5]]></title><link>https://blog.youkuaiyun.com/Code_Jumper/article/details/6682916</link><guid>https://blog.youkuaiyun.com/Code_Jumper/article/details/6682916</guid><author>Code_Jumper</author><pubDate>Fri, 12 Aug 2011 19:51:36 +0800</pubDate><description><![CDATA[速算24的变形版！数据量小，暴力枚举水过~~
糟践的代码~~
#include
#include
#include
#include
#include
#include


#define ADD 0
#define SUB 1
#define MUL 2]]></description><category></category></item><item><title><![CDATA[Uva 167 The Sultan's Successors]]></title><link>https://blog.youkuaiyun.com/Code_Jumper/article/details/6682909</link><guid>https://blog.youkuaiyun.com/Code_Jumper/article/details/6682909</guid><author>Code_Jumper</author><pubDate>Fri, 12 Aug 2011 19:47:11 +0800</pubDate><description><![CDATA[简单的八皇后问题，水过~~
注意输出格式就可以~~
#include
#include
#include
#include
#include
#include


using namespace std;


int vis[3][16];
int c]]></description><category></category></item><item><title><![CDATA[uva 331 Mapping the Swaps]]></title><link>https://blog.youkuaiyun.com/Code_Jumper/article/details/6682891</link><guid>https://blog.youkuaiyun.com/Code_Jumper/article/details/6682891</guid><author>Code_Jumper</author><pubDate>Fri, 12 Aug 2011 19:26:59 +0800</pubDate><description><![CDATA[求给定数组相邻元素的交换次数！简单的回溯！
#include
#include
#include
#include
#include
#include
using namespace std;
int n,ans,minn;
int num[6];
inlin]]></description><category></category></item><item><title><![CDATA[uva 10700 Camel trading]]></title><link>https://blog.youkuaiyun.com/Code_Jumper/article/details/6681419</link><guid>https://blog.youkuaiyun.com/Code_Jumper/article/details/6681419</guid><author>Code_Jumper</author><pubDate>Fri, 12 Aug 2011 12:16:51 +0800</pubDate><description><![CDATA[题目说了很多，但方法很简单，就是变换一下‘+’和‘*’的优先级，然后分别输出就OK！注意long long 就没问题了！
水过~~
 
#include
#include
#include
#include
#include
#include
using nam]]></description><category></category></item><item><title><![CDATA[Alignment of Code POJ 3959 HDU 3753]]></title><link>https://blog.youkuaiyun.com/Code_Jumper/article/details/6672809</link><guid>https://blog.youkuaiyun.com/Code_Jumper/article/details/6672809</guid><author>Code_Jumper</author><pubDate>Tue, 09 Aug 2011 16:03:52 +0800</pubDate><description><![CDATA[这题在POJ、HDU、UVAlive上都有出现，是Northeastern Europe 2010区域赛的A题，是比较水的，但是我在HDU上过这题还是废了些功夫的，尤其是数组大小问题，在HDU上word[100][80]是会被WA掉的，但开word[100][85]是会被AV(A]]></description><category></category></item></channel></rss>