hint to solve pillars problem educational codeforces round division 2.

Правка en2, от AM_I_Learning, 2019-07-23 13:50:22

solution is that check if there is an entry in the array from i=2 to i=n-1; such that a[i]<a[i-1]&&a[i]<a[i+1]. If there is such a value ans is NO else answer is always "YES". This is an easy way to solve that problem.... OK................

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский AM_I_Learning 2019-07-23 13:50:22 23 Tiny change: 'at problem' -> 'at problem.... OK................' (published)
en1 Английский AM_I_Learning 2019-07-23 13:49:36 291 Initial revision (saved to drafts)