[POJ3693]Maximum repetition substring

[POJ3693]Maximum repetition substring试题描述The repetition number of a string is defined as the maximum number R such that the string can be pa
19次阅读

BZOJ2588 Spoj 10628. Count on a tree

本文版权归ljh2000和博客园共有,欢迎转载,但须保留此声明,并给出原文链接,谢谢合作。  本文作者:ljh2000 作者博客:http://www.cnblogs.com/ljh2000-jump/转载请注明出处,侵权必究,保留最终解释权!  题目链接:B
26次阅读

[POJ2774]Long Long Message

[POJ2774]Long Long Message试题描述The little cat is majoring in physics in the capital of Byterland. A piece of sad news comes to him these days: his moth
23次阅读

BZOJ2616 : SPOJ PERIODNI

长为$A$,宽为$B$的矩阵放$K$个车的方案数$=C(A,K)\times C(B,K)\times K!$。建立笛卡尔树,那么左右儿子独立,设$f[i][j]$表示$i$子树内放$j$个车的方案数。合并左右儿子之后,枚举在底部矩形放几个车进行转移即可。时间复杂度$O(n^3)$。 #i
18次阅读

[POJ2001]Shortest Prefixes

[POJ2001]Shortest Prefixes试题描述A prefix of a string is a substring starting at the beginning of the given string. The prefixes of "carbon" are: "c", "c
16次阅读

POJ1988 Cube Stacking

Cube StackingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 24665 Accepted: 8653Case Time Limit: 1000MSD
10次阅读

[codevs3044][POJ1151]矩形面积求并

[codevs3044][POJ1151]矩形面积求并试题描述输入n个矩形,求他们总共占地面积(也就是求一下面积的并)输入可能有多组数据,读到n=0为止(不超过15组)每组数据第一行一个数n,表示矩形个数(n<=100)接下来n行每行4个实数x1,y1,x2,y1(0 <= x1 <
15次阅读

2588: Spoj 10628. Count on a tree

2588: Spoj 10628. Count on a treeTime Limit: 12 Sec  Memory Limit: 128 MBSubmit: 5766  Solved: 1374[Submit][St
23次阅读

[SPOJ705]不同的子串

1709. [SPOJ705]不同的子串★★   输入文件:subst1.in   输出文件:subst1.out   简单对比时间限制:1 s   内存限制:256 MB【题目描述】给定一个字符串,计算其不同
11次阅读

POJ 3252 Round Numbers

Round NumbersTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12824 Accepted: 4946DescriptionThe cows, as you k
25次阅读