QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#687818 | #6434. Paimon Sorting | Palbudir | TL | 0ms | 3652kb | C++20 | 1.2kb | 2024-10-29 21:24:54 | 2024-10-29 21:24:55 |
Judging History
answer
#include <bits/stdc++.h>
using i80 = __int128;
using i64 = long long;
using f80 = long double;
void work() {
int n;
std::cin >> n;
std::vector<int> a(n);
std::map<int, int> set;
std::map<int, std::vector<int>> map;
int ans = 0;
for (int i = 0; i < n; ++i) {
int x;
std::cin >> x;
map[x].push_back(i);
if (i == 0) {
std::cout << 0;
++set[x];
continue;
}
int res;
if (set.rbegin()->first < x) {
int y = set.rbegin()->first;
if (map[y].size() == 1) {
res = 2;
} else {
res = i - map[y][1] + 2;
}
} else if (set.rbegin()->first == x) {
res = 0;
} else {
res = std::distance(set.upper_bound(x), set.end());
}
ans += res;
std::cout << " " << ans;
++set[x];
}
std::cout << "\n";
return;
}
void init() {
}
int main() {
init();
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr), std::cout.tie(nullptr);
int t = 1;
std::cin >> t;
while (t--) {
work();
}
return 0;
}
/*
*/
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3652kb
input:
3 5 2 3 2 1 5 3 1 2 3 1 1
output:
0 2 3 5 7 0 2 4 0
result:
ok 3 lines
Test #2:
score: -100
Time Limit Exceeded
input:
6107 19 10 13 8 8 11 18 12 9 15 19 6 13 11 11 17 9 14 2 18 12 1 8 10 2 10 2 6 1 5 9 5 7 16 14 4 2 15 12 14 10 3 2 9 15 4 12 9 5 15 10 3 2 5 6 7 8 6 1 6 4 18 6 5 12 12 11 2 10 10 5 10 13 15 13 10 17 7 11 2 1 1 2 1 1 3 2 1 2 17 11 15 3 10 7 15 15 10 5 17 3 3 14 13 11 11 2 3 2 2 3 7 6 1 7 5 3 5 1 7 2 1...
output:
0 2 4 6 7 9 11 16 17 19 28 31 36 41 43 51 55 67 68 0 2 4 6 6 8 10 14 17 18 22 25 0 1 3 5 7 8 11 16 22 26 26 31 33 37 42 42 0 1 3 5 7 9 11 17 19 23 0 1 3 3 4 8 10 12 16 18 27 29 30 34 36 42 46 55 0 0 0 0 1 1 0 2 4 6 9 9 9 11 15 21 27 33 35 38 42 46 55 0 0 3 0 1 3 5 8 10 14 0 1 3 4 6 9 9 0 1 1 3 7 11 ...