#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<int> v(n); for (int &i : v) cin >> i; vector<int> pos(n + 1); for (int i = 0; i < n; ++i) pos[v[i]] = i; int count = 0; int l = n + 1, r = -1; for (int i = n; i > 0; --i) { l = min(l, pos[i]); r = max(r, pos[i]); int required = r - l + 1; int len = n - i + 1; if (required > len) continue; int setval = (n - i + 1) / 2 + 1; count += min(n - r, min(l + 1, len - setval + 1)); } cout << 2 * n + 1 << ' ' << count << '\n'; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<int> v(n); for (int &i : v) cin >> i; vector<int> pos(n + 1); for (int i = 0; i < n; ++i) pos[v[i]] = i; int count = 0; int l = n + 1, r = -1; for (int i = n; i > 0; --i) { l = min(l, pos[i]); r = max(r, pos[i]); int required = r - l + 1; int len = n - i + 1; if (required > len) continue; int setval = (n - i + 1) / 2 + 1; count += min(n - r, min(l + 1, len - setval + 1)); } cout << 2 * n + 1 << ' ' << count << '\n'; } |