Submission #2379124

---

Source Code Expand

void main(){
  import std.stdio, std.string, std.conv, std.algorithm;

  int n; rd(n);
  auto a=readln.split.to!(int[]);

  auto pos=new int[](n+1);
  foreach(int i; 0..n) pos[a[i]]=(i+1);
  import std.container;
  auto rbt=new RedBlackTree!(int, "a<b");
  rbt.insert(0); rbt.insert(n+1);
  long sum=0;
  for(int v=1; v<=n; v++){
    int i=pos[v];
    long l=rbt.lowerBound(i).back,
         r=rbt.upperBound(i).front;
    sum+=(i-l).to!(long)*(r-i).to!(long)*v;
    rbt.insert(i);
  }
  writeln(sum);
}

void rd(T...)(ref T x){
  import std.stdio, std.string, std.conv;
  auto l=readln.split;
  assert(l.length==x.length);
  foreach(i, ref e; x){
    e=l[i].to!(typeof(e));
  }
}

Submission Info

Judge Result