记得最后处理一下a[n].
#define int long long
int n,m,a[MAXN],ans = 0;
signed main()
{
cin >> n;
rpp(i,n) cin >> a[i];
rpp(i,n-1)
{
int x = a[i],y = a[i+1];
if(x > y) ans += (x-y)*(n-x+1);
else ans += (y-x)*x;
}
ans += a[n]*(n-a[n]+1);
cout<<ans;
return 0;
}