https://mirror.codeforces.com/contest/1197
https://mirror.codeforces.com/contest/1197/problem/C
Before this contest started, I have learned and implement the dp optimization IOI 16 Alien Trick. When I see the problem C, I thought this problem can be solved With the Alien trick. Then I started trying to solve the problem and finally I got Accepted verdict. This Problem can be solved simply using sorting the difference of adjacent element. Maximum Contestant has solved this with sorting. When I saw that all Contestant solve this problem very easy way, I became very surprised. But I am happy , because I could apply the trick first day in contest time.
This is my Solution.
https://mirror.codeforces.com/contest/1197/submission/57537548
Thanks to Everyone.
Please do not be offended but this is so cyan.
this is so purple
Can't argue with that.
This is actually quite cool. I realized that I can compute the minimum of array using Li-chao tree. You can simply make $$$n$$$ lines $$$a_i \times x$$$ and query on point $$$x=1$$$!
You are right. Thank you. ko_osaga
Where can I learn about this IOI Alien Trick ? Any Links ?
I Learn this from a Bengali tutorial written by a Bangladeshi contestant Rezwan Arefin.
This is the Link.
https://rezwanarefin01.github.io/posts/ioi16-aliens-trick/
Thanks.
Can you please paste this blog link to contest page?
Link->
https://rezwanarefin01.github.io/posts/ioi16-aliens-trick/
Thanks.
No, what I meant was to leave a comment on contest announcement page that there is an alternative approach to solve this problem.
OK. I will.
Thanks for suggestion.
soul_voyage
Das some serious shit right there