need help for div.3 problem

Revision en1, by Asmodeus, 2021-06-22 00:22:53

problem is this.

https://mirror.codeforces.com/contest/1003/problem/F

i can't understand why the answer for test case below is 5

3 abcdef abcdef abcdef

my program (and i ) think A abcdef A is optimal so output 10

vovuh's solution output 5.

how 5 is possible? since we should select non-intersecting segments, at least one abcdef should remain and the answer must >=6. need help for this.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English Asmodeus 2021-06-22 00:22:53 435 Initial revision (published)