QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #576687 | #9313. Make Max | susuland | WA | 100ms | 6068kb | C++14 | 1.3kb | 2024-09-19 21:35:02 | 2024-09-19 21:35:08 |
Judging History
answer
#include<iostream>
#include<stack>
using namespace std;
stack<int> x;
int a[200005],l[200005],r[200005];
long long int ans;
int main()
{
int t;
cin>>t;
int n;
while(t--){
ans=0;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
if(x.empty()||a[x.top()]>a[i]){
x.push(i);
}
else{
while(!x.empty()&&a[x.top()]<=a[i]){
r[x.top()]=i;
x.pop();
}
x.push(i);
}
}
while(!x.empty()){
r[x.top()]=n+1;
x.pop();
}
for(int i=n;i>=1;i--){
if(x.empty()||a[x.top()]>a[i]){
x.push(i);
}
else{
while(!x.empty()&&a[x.top()]<=a[i]){
l[x.top()]=i;
x.pop();
}
x.push(i);
}
}
while(!x.empty()){
l[x.top()]=0;
x.pop();
}
for(int i=1;i<=n;i++){
if(!l[i]&&a[l[i]]!=a[i]){
ans+=r[i]-l[i]-2;
}
else{
ans+=r[i]-i-1;
}
}
cout<<ans<<endl;
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3592kb
input:
4 2 1 2 2 2 2 7 1 1 1 2 2 2 2 3 1 2 3
output:
1 0 3 3
result:
ok 4 number(s): "1 0 3 3"
Test #2:
score: -100
Wrong Answer
time: 100ms
memory: 6068kb
input:
2 198018 875421126 585870339 471894633 383529988 625397685 944061047 704695631 105113224 459022561 760848605 980735314 847376362 980571959 329939331 644635272 326439858 752879510 837384394 175179068 182094523 397239381 1199016 185143405 279638454 252374970 822030887 860312140 137248166 993229443 164...
output:
2151880 2292908
result:
wrong answer 1st numbers differ - expected: '4084978', found: '2151880'