Codeforces 339B. Xenia and Ringroad Solution

  ///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///AH Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

1. #include <bits/stdc++.h>
2. using namespace std;
3. int main()
4. {
5. long long int m,n,i,s=0,v=1;
6. cin>>n>>m;
7. long long int a[m+9];
8. for(i=0; i<m; i++)
9. cin>>a[i];
10. for(i=0; i<m; i++)
11. {
12. if(a[i]>v)
13. {
14. s+=a[i]-v;
15. v=a[i];
16. }
17. else if(a[i]<v)
18. {
19. s+=n-v+a[i];
20. v=a[i];
21. }
22. }
23. cout<<s<<endl;
24. }