Parade Show
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 921 Accepted Submission(s): 386
Problem Description
2013 is the 60 anniversary of Nanjing University of Science and Technology, and today happens to be the anniversary date. On this happy festival, school authority hopes that the new students to be trained for the parade show. You should plan a better solution to arrange the students by choZ??http://www.2cto.com/kf/ware/vc/" target="_blank" class="keylink">vc2luZyBzb21lIHF1ZXVlcyBmcm9tIHRoZW0gcHJlcGFyaW5nIHRoZSBwYXJhZGUgc2hvdy4gKG9uZSBzdHVkZW50IG9ubHkgaW4gb25lIHF1ZXVlIG9yIG5vdCBiZSBjaG9zZW4pPGJyPgogIEV2ZXJ5IHN0dWRlbnQgaGFzIGl0cyBvd24gbnVtYmVyLCBmcm9tIDEgdG8gbi4gKDE8PW48PTEwXjUpLCBhbmQgdGhleSBhcmUgc3RhbmRpbmcgZnJvbSAxIHRvIG4gaW4gdGhlIGluY3JlYXNpbmcgb3JkZXIgdGhlIHNhbWUgd2l0aCB0aGVpciBudW1iZXIgb3JkZXIuIEFjY29yZGluZyB0byByZXF1aXJlbWVudCBvZiBzY2hvb2wgYXV0aG9yaXR5LCBldmVyeSBxdWV1ZSBpcyBjb25zaXN0ZWQgb2YgZXhhY3RseSBtIHN0dWRlbnRzLiBCZWNhdXNlCiBzdHVkZW50cyB3aG8gc3RhbmQgYWRqYWNlbnQgaW4gdHJhaW5pbmcgYXJlIGFzc2lnbmVkIGNvbnNlY3V0aXZlIG51bWJlciwgZm9yIGJldHRlciBhcnJhbmdlbWVudCwgeW91IHdpbGwgY2hvb3NlIGluIHN0dWRlbnRzIHdpdGggaW4gY29uc2VjdXRpdmUgbnVtYmVycy4gV2hlbiB5b3UgY2hvb3NlIHRoZXNlIG0gc3R1ZGVudHMsIHlvdSB3aWxsIHJlYXJyYW5nZSB0aGVpciBudW1iZXJzIGZyb20gMSB0byBtLCBpbiB0aGUgc2FtZSBvcmRlciB3aXRoCiB0aGVpciBpbml0aWFsIG9uZS4gPGJyPgogIElmIHdlIGRpdmlkZSBvdXIgc3R1ZGVudHOhryBoZWlnaHRzIGludG8gayAoMTw9azw9MjUpIGxldmVsLCBleHBlcmllbmNlIHNheXMgdGhhdCB0aGVyZSB3aWxsIGV4aXN0IGFuIGJlc3Qgdmlld2luZyBtb2R1bGUsIHJlcHJlc2VudGVkIGJ5IGFuIGFycmF5IGFbXS4gYVtpXSAoMTw9aTw9bSlzdGFuZHMgZm9yIHRoZSBzdHVkZW50oa9zIGhlaWdodCB3aXRoIG51bWJlciBpLiBJbiBmYWN0LCBpbnNpZGUgYSBxdWV1ZSwgZm9yIGV2ZXJ5IG51bWJlciBwYWlyCiBpLCBqICgxPD1pLGo8PW0pLCBpZiB0aGUgcmVsYXRpdmUgYmlnZ2VyIG9yIHNtYWxsZXIgb3IgZXF1YWwgdG8gcmVsYXRpb25zaGlwIGJldHdlZW4gdGhlIGhlaWdodCBvZiBzdHVkZW50IG51bWJlciBpIGFuZCB0aGUgaGVpZ2h0IG9mIHN0dWRlbnQgbnVtYmVyIGogaXMgdGhlIHNhbWUgd2l0aCB0aGF0IGJldHdlZW4gYVtpXSBhbmQgYVtqXSwgdGhlbiB0aGUgcXVldWUgaXMgd2VsbCBkZXNpZ25lZC4gR2l2ZW4gbiBzdHVkZW50c6GvIGhlaWdodCBhcnJheQogeFtdICgxPD14W2ldPD1rKSwgYW5kIHRoZSBiZXN0IHZpZXdpbmcgbW9kdWxlIGFycmF5IGFbXSwgaG93IG1hbnkgd2VsbCBkZXNpZ25lZCBxdWV1ZXMgY2FuIHdlIG1ha2UgYXQgbW9zdD88YnI+CgoKIAo8YnI+CgpJbnB1dAoKTXVsdGlwbGUgY2FzZXMsIGVuZCB3aXRoIEVPRi48YnI+CkZpcnN0IGxpbmUsIDMgaW50ZWdlcnMsIG4gKDE8PW48PTEwXjUpIG0gKDE8PW08PW4pIGsoMTw9azw9MjUpLDxicj4KU2Vjb25kIGxpbmUsIG4gc3R1ZGVudHOhryBoZWlnaHQgYXJyYXkgeFtdICgxPD14W2ldPD1rLDE8PWk8PW4pOzxicj4KVGhpcmQgbGluZSwgbSBpbnRlZ2VycywgYmVzdCB2aWV3aW5nIG1vZHVsZSBhcnJheSBhW10gKDE8PWFbaV08PWssMTw9aTw9bSk7PGJyPgoKCiAKPGJyPgoKT3V0cHV0CgpPbmUgaW50ZWdlciwgdGhlIG1heGltYWwgYW1vdW50IG9mIHdlbGwgZGVzaWduZWQgcXVldWVzLjxicj4KCgogCjxicj4KClNhbXBsZSBJbnB1dAoKPHByZSBjbGFzcz0="brush:java;">10 5 10 2 4 2 4 2 4 2 4 2 4 1 2 1 2 1
Sample Output
1
KMP的变形题，关键在于处理相对高度这个问题。
一个个匹配过去，如果前缀匹配，并且加上当前字母后，前面比这个字母小的，相等的，大于的数字个数都相等，就是匹配，剩下的就是KMP了。
代码：
#include
#include
const int N = 100005; const int M = 26; int n, m, k, seq[N], seq1[N], next[N], i, t, sum1[M][N], sum2[M][N]; bool judge(int i, int j, int sum1[][N], int sum2[][N], int *seq, int *