Problem

Revision en2, by dp_is_life, 2021-04-06 12:59:58

select two non overlapping segment such that sum of their length minimum. O(n) eg. [2,5], [4,6], [6,7]

ans-6 explanation 2 is overlapped with first and third but 1 and 3 is not ans-(5-2+1)+(7-6+1)=6 1<=n<=10^6 timeLimit-1 second

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English dp_is_life 2021-04-06 12:59:58 14 Tiny change: '(n)\neg.\n2 5\n4 6\n6 7\n\nans-6\' -> '(n)\neg.\n[2,5],\n[4,6],\n[6,7]\n\nans-6\'
en1 English dp_is_life 2021-04-06 12:58:56 242 Initial revision (published)