# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1002486 | TitanicXDzz | Pilot (NOI19_pilot) | C++14 | 140 ms | 8132 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int a[1000010];
int l[1000010];
int r[1000010];
int dp[100010];
priority_queue<pair<int,int>> pq;
int main(){
int n,q;
cin>>n>>q;
l[0]=-1;
r[0]=1;
l[n+1]=n;
r[n+1]=n+2;
int maxi=0;
for(int i=1;i<=n;i++){
cin>>a[i];
l[i]=i-1;
r[i]=i+1;
pq.push({-a[i],-i});
if(a[i]>maxi)
maxi=a[i];
}
int sumi=0;
while(pq.empty()==0){
int x=pq.top().first;
int y=pq.top().second;
pq.pop();
int g=(r[-y]-r[-y-1])*(l[-y+1]-l[-y]);
sumi+=g;
l[r[-y-1]]=l[-y+1];
r[l[-y+1]]=r[-y-1];
dp[-x]=sumi;
}
for(int i=1;i<=1000000;i++){
if(dp[i]==0)
dp[i]=dp[i-1];
}
for(int i=0;i<q;i++){
int ans;
cin>>ans;
cout<<dp[ans]<<endl;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |