2015年03月_刀刀狗0102

原创 zoj3847--Collect Chars(搜索+dp)

Collect Chars Time Limit: 2 Seconds Memory Limit: 65536 KB Bob was playing MC and was punished by Alice. Bob was trapped in a maze and there were some characters on some specific cell

2015-03-23 16:36:27 977

原创 poj3140--Contestants Division(树形dp-水题)

Contestants DivisionTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8469 Accepted: 2420DescriptionIn the new ACM-ICPC Regional Contest, a special monito

2015-03-13 19:46:09 869

原创 poj2486--Apple Tree(树状dp)

Apple TreeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7789 Accepted: 2606DescriptionWshxzt is a lovely girl. She likes apple very much. One day HX tak

2015-03-13 17:05:10 1197

原创 Codeforces Beta Round #7--D. Palindrome Degree（Manacer）

题目：http://blog.csdn.net/winddreams/article/details/44218961求出每个点为中心的最长字符串，判断该串是不是从开头的回文串。 #include #include #include using namespace std ;int p[12000000] , dp[6000000];char s[12000000]

2015-03-12 16:35:15 840

原创 Codeforces Beta Round #7--D. Palindrome Degree（hash）

D. Palindrome Degreetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputString s of length n is called k-pali

2015-03-12 10:59:15 1479

原创 hdu3068--最长回文(Manacer算法)

最长回文Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9418 Accepted Submission(s): 3238Problem Description 给出一个只由小写英文字符a,b,c...

2015-03-12 10:52:54 892

转载 Manacher算法--O（n）回文子串算法 .

O（n）回文子串算法这里，我介绍一下O（n）回文串处理的一种方法。Manacher算法.原文地址：http://zhuhongcheng.wordpress.com/2009/08/02/a-simple-linear-time-algorithm-for-finding-longest-palindrome-sub-string/ 其实原文说得是比较清楚的，只是英

2015-03-12 10:46:50 702

原创 poj1947--Rebuilding Roads(树状dp)

Rebuilding RoadsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 9496 Accepted: 4316DescriptionThe cows have reconstructed Farmer John's farm, with its N b

2015-03-06 20:23:58 1238

原创 codefoces--510D. Fox And Jumping

D. Fox And Jumpingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFox Ciel is playing a game. In this game

2015-03-03 20:39:31 1027

原创 Codeforces Round #295 (Div. 2) A+B+C

A题：找出字符串中是否出现了26个英文字母，不区分大小写#include #include #include using namespace std ;char str[200] ;int a[30] , b[30] ;int main(){ int n , i ; scanf("%d", &n) ; scanf("%s", str)

2015-03-03 19:44:54 906

随风的专栏