#include<iostream> #include<algorithm> using namespace std; int main() { int n,a[11000],l,r,cnt=0; cin>>n; for (int i=1;i<=n;i++) cin>>a[i]; int tmp=0,j=l,k=l+1; while (k<=r+1) if (a[k]<a[j]) { tmp+=a[k]; k++; } else { cnt+=(k-j-1)*a[j]-tmp; tmp=0; j=k; k++; } j=r;k=r-1; while (k>=l-1) if (a[k]<=a[j]) { tmp+=a[k]; k--; } else { cnt+=(j-k-1)*a[j]-tmp; tmp=0; j=k; k--; } cout<<cnt; return 0; }