怎么可能，暴力至少也得n^3logn吧

• 确实是0ms (23) mmd 2006-11-08 10:08:45
  • 具体怎么暴力？我的想法 (95) waterine 2006-11-08 10:31:44
    • Re:具体怎么暴力？我的想法 (153) frkstyc 2006-11-08 10:37:23
      • Re:具体怎么暴力？我的想法 (113) Sempr 2006-11-08 13:59:09
        • Re:具体怎么暴力？我的想法 (133) frkstyc 2006-11-08 14:05:04
          • mei ju suo you 3~n chang du de chuan ran hou pi pei ba... O(m*n*n*4^n) (18) ArXoR 2006-11-08 14:33:48
            • 这个你刷得过去么…… (0) frkstyc 2006-11-08 14:35:27
              • -_-b...we can make it through by distrbuting sub-tasks to computers all around the world... (0) ArXoR 2006-11-08 14:45:20
    • 后缀数组o(nm) (105) sunmoonstar 2006-11-08 10:45:54
    • 枚举出所有子串 排序, n*n*m*log(n*n*m) (105) sunmoonstar 2006-11-08 11:01:59
      • 直接用stl, 水过去了-_- (0) qywyh_scut 2006-11-08 11:22:40
    • ORZ (0) Sempr 2006-11-08 13:56:17
• naive brute force algo could be O(mn^2), notice the properity of next[] generated by KMP (23) ArXoR 2006-11-08 13:30:02
  • property...not properity...-_-b (0) ArXoR 2006-11-08 13:33:20