Looking for flaw in my solution for Round #605(Div. 3D)

Revision en1, by levi.ackerman1732, 2021-03-01 11:25:20

Problem: 1272D - Remove One Element

My Solution:108781615

Hello all,

My idea: if two elements are in strictly increasing order(i.e a[I]<a[I+1]) dp[I+1] = dp[I] + 1 else check if a[I-1] < a[I+1] then dp[I+1] = dp[I-1] + 1

I am not sure where this is going wrong. Any help is appreciated. Thanks for your time.

Tags # dp, #brute force

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English levi.ackerman1732 2021-03-01 11:26:06 10
en1 English levi.ackerman1732 2021-03-01 11:25:20 381 Initial revision (published)