std::string find_most_useful_string(std::string const & doc)
{
// measure all strings in doc in a naive way, finding the one with
the most repetitions.
// stop when repetitions * length^2 decreases
}
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
- Re: [ot][spam][crazy][crazy][spam] Karl Semich
