MrBlank的ACM记事本

inline void BuildNext(char pattern[], int length, int next[]) { int i, t; i = 1; t = 0; next[1] = 0; while(i < length + 1) { while(t > 0 && pattern[i - 1] != pattern[t -

Number SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 18136 Accepted Submission(s): 7936Problem Description Given two sequences o

剪花布条Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 13624 Accepted Submission(s): 8681Problem Description 一块花布条，里面有些图案，另有一块直接可用的小饰条，里面也有一些图