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.