Submission #9559840

---

Source Code Expand

#include <iostream>
#include <string>
#include <math.h>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <set>
#include <queue>
#include <map>
#include <stack>
using namespace std;

#define mod 1000000007
#define ten5 100005
#define ten52 200005
#define ten6 1000005
#define PI 3.1415926

typedef long long int ll;

ll num[ten5];
//ll num2[ten5];
//char cmap[10][10];


int main()
{
    //int m,n,o=0,i,j,k;
    long long int sum=0,sum2=0,n1=0,n2=0,n3,range;
    double ans=0.0,half;
    long long int m,n,o,i,j,k=1;
    long long int a,a1,a2,a3,a4,a5,a6;
    a=a1=a2=a3=a4=a5=a6=0;
    //float f,g,h;
    //string s,s1;
    //priority_queue<long long int> pq;
    //stack<int> stk;
    //vector<pair<ll,ll>> vint;
    //vector<ll> vtime;
    //map<pair<ll,ll>,ll> mp;
    //list<int> li;
    //set<int> sint;
    //char now,pre,c;
    cin>>n;
    for(i=1;i<=n;i++)
    {
        a1=a;
        cin>>a;
        num[i]=a;
        sum+=abs(a-a1);
    }
    sum+=abs(a);
    //cout<<sum;
    for(i=1;i<=n;i++)
    {
        n1=abs(num[i]-num[i-1])+abs(num[i]-num[i+1]);
        n2=abs(num[i-1]-num[i+1]);
        sum2=sum-n1+n2;
        cout<<sum2<<endl;
    }
    return 0;
}

Submission Info

Judge Result