2013年10月1日
LightOJ 1033 区间dp
摘要： 其实就是求最长回文序列的长度m,然后答案=n-m;/********************LightOJ 1033Author:Cdegree********************/#include #include #include #include #include #include #include #include #include #include #include #include #include #define X first#define Y second#define sqr(x) (x)*(x)#pragma comment(linker,"/STACK:1 阅读全文
posted @ 2013-10-01 20:07 degree 阅读(232) 评论(0) 推荐(0)
LightOJ 1032 按位dp
摘要： /********************LightOJ 1032Author:Cdegree********************/#include #include #include #include #include #include #include #include #include #include #include #include #include #define X first#define Y second#define sqr(x) (x)*(x)#pragma comment(linker,"/STACK:102400000,102400000") 阅读全文
posted @ 2013-10-01 20:00 degree 阅读(217) 评论(0) 推荐(0)
LightOJ 1031 区间dp
摘要： /********************LightOJ 1031Author:Cdegree********************/#include #include #include #include #include #include #include #include #include #include #include #include #include #define X first#define Y second#define sqr(x) (x)*(x)#pragma comment(linker,"/STACK:102400000,102400000") 阅读全文
posted @ 2013-10-01 16:00 degree 阅读(290) 评论(0) 推荐(0)
LightOJ 1030 概率dp
摘要： /********************Author:Cdegree********************/#include #include #include #include #include #include #include #include #include #include #include #include #include #define X first#define Y second#define sqr(x) (x)*(x)#pragma comment(linker,"/STACK:102400000,102400000")using namesp 阅读全文
posted @ 2013-10-01 15:27 degree 阅读(163) 评论(0) 推荐(0)
LightOJ 1027 概率
摘要： 平均访问时间为sum(t)/n,期望次数为n/n1#include #include #include #include #include #include #include #include #include #include #include #include #include #define X first#define Y second#define sqr(x) (x)*(x)#pragma comment(linker,"/STACK:102400000,102400000")using namespace std;const double PI = acos( 阅读全文
posted @ 2013-10-01 15:26 degree 阅读(164) 评论(0) 推荐(0)
HDU 3376 最小费用最大流
摘要： #include #include #include #include #include #include #include #include #include #include #include #include #include #define X first#define Y second#define sqr(x) (x)*(x)#pragma comment(linker,"/STACK:102400000,102400000")using namespace std;const double PI = acos(-1.0);map::iterator it;ty 阅读全文
posted @ 2013-10-01 15:04 degree 阅读(187) 评论(0) 推荐(0)
HDU 3068 O(n)最长回文字符串
摘要： #include #include #include #include #include #include #include #include #include #include #include #include #include #define X first#define Y second#define sqr(x) (x)*(x)#pragma comment(linker,"/STACK:102400000,102400000")using namespace std;const double PI = acos(-1.0);map::iterator it;ty 阅读全文
posted @ 2013-10-01 15:04 degree 阅读(150) 评论(0) 推荐(0)
HDU 4333 KMP&EXKMP
摘要： #include #include #include #include #include #include #include #include #include #include #include #include #include #define X first#define Y second#define sqr(x) (x)*(x)#pragma comment(linker,"/STACK:102400000,102400000")using namespace std;const double PI = acos(-1.0);map::iterator it;ty 阅读全文
posted @ 2013-10-01 15:03 degree 阅读(149) 评论(0) 推荐(0)
HDU 4300 KMP
摘要： #include #include #include #include #include #include #include #include #include #include #include #include #include #define X first#define Y second#define sqr(x) (x)*(x)#pragma comment(linker,"/STACK:102400000,102400000")using namespace std;const double PI = acos(-1.0);map::iterator it;ty 阅读全文
posted @ 2013-10-01 15:02 degree 阅读(129) 评论(0) 推荐(0)
HDU 2594 KMP
摘要： #include #include #include #include #include #include #include #include #include #include #include #include #include #define X first#define Y second#define sqr(x) (x)*(x)#pragma comment(linker,"/STACK:102400000,102400000")using namespace std;const double PI = acos(-1.0);map::iterator it;ty 阅读全文
posted @ 2013-10-01 15:01 degree 阅读(99) 评论(0) 推荐(0)
HDU 2087 KMP
摘要： #include #include #include #include #include #include #include #include #include #include #include #include #include #define X first#define Y second#define sqr(x) (x)*(x)#pragma comment(linker,"/STACK:102400000,102400000")using namespace std;const double PI = acos(-1.0);map::iterator it;ty 阅读全文
posted @ 2013-10-01 14:59 degree 阅读(134) 评论(0) 推荐(0)
HDU 1358 KMP
摘要： #include #include #include #include #include #include #include #include #include #include #include #include #include #define X first#define Y second#define sqr(x) (x)*(x)#pragma comment(linker,"/STACK:102400000,102400000")using namespace std;const double PI = acos(-1.0);map::iterator it;ty 阅读全文
posted @ 2013-10-01 14:56 degree 阅读(110) 评论(0) 推荐(0)
HDU 3746 KMP
摘要： #include #include #include #include #include #include #include #include #include #include #include #include #include #define X first#define Y second#define sqr(x) (x)*(x)#pragma comment(linker,"/STACK:102400000,102400000")using namespace std;const double PI = acos(-1.0);map::iterator it;ty 阅读全文
posted @ 2013-10-01 14:55 degree 阅读(155) 评论(0) 推荐(0)
HDU 3336 KMP
摘要： #include #include #include #include #include #include #include #include #include #include #include #include #include #define X first#define Y second#define sqr(x) (x)*(x)#pragma comment(linker,"/STACK:102400000,102400000")using namespace std;const double PI = acos(-1.0);map::iterator it;ty 阅读全文
posted @ 2013-10-01 14:54 degree 阅读(148) 评论(0) 推荐(0)