mhlwsk的博客

Description FJ has moved his K (1 <= K <= 30) milking machines out into the cow pastures among the C (1 <= C <= 200) cows. A set of paths of various lengths runs among the cows and the milki

题目链接：http://poj.org/problem?id=1743 后缀数组+二分答案，可以看一下罗神的《后缀数组——处理字符串的有力工具》#include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int N=20050; int n,num[N]; int sa[N],rank[N