原创 HDU6074 Phone Call(並查集,lca)

Phone Call Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others) Total Submission(s):

原创 POJ6071 Lazy Running(最短路)

Lazy Running Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others) Total Submission(s

原创 HDU6078 Wavel Sequence(動態規劃)

Wavel Sequence Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others) Total Submission

原创 POJ1269——Intersecting Lines(計算幾何,直線關係判斷)

Intersecting Lines Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 16680   Accepted: 7191 Descriptio

原创 POJ2774 Long Long Message(後綴數組)

Long Long Message Time Limit: 4000MS   Memory Limit: 131072K Total Submissions: 31523   Accepted: 12719 Case Time Li

原创 Gym - 101194F Mr. Panda and Fantastic Beasts (後綴數組)

題意:給出n個字符串,找到最短的字符串,要求僅爲第一個字符串的子串。 思路:把n個字符串用不出現的字符連接起來。其實就是枚舉第一個字符串的每一個子串是否是其他字符串的後綴的前綴即可。 #include<cstdio> #include<

原创 POJ3693 Maximum repetition substring (後綴數組)

The repetition number of a string is defined as the maximum number R such that the string can be partitioned into R s

原创 POJ3294——Life Forms 後綴數組

Life Forms Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 15912   Accepted: 4695 Description You m

原创 HDU5492 Find a path (動態規劃)

Find a path Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s):

原创 codefcodeforces 845D Driving Test(棧)

Driving Test time limit per test 2 seconds memory limit per test 256 megabytes input standard input outp

原创 HDU5493 Queue(線段樹)

Queue Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1363  

原创 HDU6059 Kanade's trio(異或字典樹)

Kanade's trio Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others) Total Submission(

原创 POJ2318 TOYS(叉積,計算幾何)

TOYS Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 16234   Accepted: 7786 Description Calculate th

原创 Relevant Phrases of Annihilation SPOJ - PHRASES 後綴數組

PHRASES - Relevant Phrases of Annihilation no tags  You are the King of Byteland. Your agents have just int

原创 SPOJ - DISUBSTR Distinct Substrings (後綴數組)

DISUBSTR - Distinct Substrings no tags  Given a string, we need to find the total number of its distinct substrin