Submission #1442209
Source Code Expand
#include<bits/stdc++.h> using namespace std; set<int> s; int n,a[200010],p[200010],b,c; int main(){ cin>>n;s.insert(-1),s.insert(n); for(int i=0;i<n;i++){cin>>a[i];p[a[i]-1]=i;} long long r=0; for(int i=0;i<n;i++){ s.insert(p[i]); set<int>::iterator t=s.find(p[i]); t++;b=*t;t--;t--;c=*t; r+=(b-p[i])*(p[i]-c)*(i+1); }cout<<r<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Minimum Sum |
User | ynymxiaolongbao |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 375 Byte |
Status | WA |
Exec Time | 179 ms |
Memory | 11136 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0, example1, example2 |
All | corner0, corner1, corner2, corner3, example0, example1, example2, maxrand0, maxrand1, maxrand2, rand0, rand1, rand2 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
corner0 | WA | 175 ms | 11136 KB |
corner1 | WA | 179 ms | 11136 KB |
corner2 | AC | 1 ms | 256 KB |
corner3 | WA | 128 ms | 11136 KB |
example0 | AC | 1 ms | 256 KB |
example1 | AC | 1 ms | 256 KB |
example2 | AC | 1 ms | 256 KB |
maxrand0 | WA | 167 ms | 11136 KB |
maxrand1 | WA | 165 ms | 11136 KB |
maxrand2 | WA | 166 ms | 11136 KB |
rand0 | AC | 1 ms | 256 KB |
rand1 | AC | 1 ms | 256 KB |
rand2 | AC | 1 ms | 256 KB |