Submission #3403260

---

Source Code Expand

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
    using namespace std;

    int main(){
      ll n;
      cin >> n;
      ll a[n+1];
      ll pos=0;
      ll ans=0;
      rep(i,n)cin >> a[i];
      a[n]=0;
      while(pos<n-1){
        int d1=abs(a[pos]-a[pos+1]);
        int d2=abs(a[pos]-a[pos+2]);
       if(pos<=n-3 && d1>=d2){
         ans+=d2;
         pos+=2;
       }
        else if(pos<=n-3 && d1<d2){
         ans+=d1;
          pos++;
        }
        else{
         ans+=d1;
          pos++;
        }
      }
      cout << ans << endl;
      return 0;}

Submission Info

Judge Result