QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#634022 | #9313. Make Max | klhwong# | WA | 28ms | 3568kb | C++17 | 1.4kb | 2024-10-12 16:35:02 | 2024-10-12 16:35:04 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
using namespace std;
int t{}, n{}, temp{};
signed main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> t;
while(t--) {
cin >> n;
stack<pair<int, int>> stk;
int answer = 0;
for (int i = 0; i < n; i++) {
cin >> temp;
if (stk.empty()) {
stk.push({temp, 1});
} else if (stk.top().first == temp) {
int cnt = stk.top().second + 1;
stk.pop();
stk.push({temp, cnt});
} else if (stk.top().first < temp) {
int add = 0;
int cnt = 1;
while (!stk.empty() && stk.top().first < temp) {
add += add;
add += stk.top().second;
cnt += stk.top().second;
stk.pop();
}
answer += add;
while (!stk.empty() && stk.top().first == temp) {
cnt += stk.top().second;
stk.pop();
}
stk.push({temp, cnt});
} else {
stk.push({temp, 1});
}
}
int add = 0;
while (stk.size() > 1) {
add += add;
add += stk.top().second;
stk.pop();
}
cout << answer + add << '\n';
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3560kb
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: 28ms
memory: 3568kb
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:
12355621 11927196
result:
wrong answer 1st numbers differ - expected: '4084978', found: '12355621'