#include <bits/stdc++.h> #define dbg(x) " [" << #x << ": " << (x) << "] " using namespace std; template<typename A,typename B> ostream& operator<<(ostream& out,const pair<A,B>& p) { return out << "(" << p.first << ", " << p.second << ")"; } template<typename T> ostream& operator<<(ostream& out,const vector<T>& c) { out << "{"; for(auto it = c.begin(); it != c.end(); it++) { if(it != c.begin()) out << ", "; out << *it; } return out << "}"; } void solve() { int n; cin >> n; vector<int> v(n); vector<int> vv(n + 1); for(int i = 0; i < n; i++) { cin >> v[i]; vv[v[i]] = i; } cout << 2 * n + 1 << " "; long long ans = 0; int l = n - 1,r = 0; for(int i = 1; i <= n; i += 2) { int j = vv[n - i / 2]; l = min(l,j); r = max(r,j); ans += max(0,min(l,n - i) - max(0,r - i + 1) + 1); } l = vv[n]; r = vv[n]; for(int i = 2; i <= n; i += 2) { int j = vv[n - i / 2]; l = min(l,j); r = max(r,j); ans += max(0,min(l,n - i) - max(0,r - i + 1) + 1); } cout << ans << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int testNum = 1; //cin >> testNum; for(int i = 1; i <= testNum; i++) { solve(); } return 0; }
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 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 | #include <bits/stdc++.h> #define dbg(x) " [" << #x << ": " << (x) << "] " using namespace std; template<typename A,typename B> ostream& operator<<(ostream& out,const pair<A,B>& p) { return out << "(" << p.first << ", " << p.second << ")"; } template<typename T> ostream& operator<<(ostream& out,const vector<T>& c) { out << "{"; for(auto it = c.begin(); it != c.end(); it++) { if(it != c.begin()) out << ", "; out << *it; } return out << "}"; } void solve() { int n; cin >> n; vector<int> v(n); vector<int> vv(n + 1); for(int i = 0; i < n; i++) { cin >> v[i]; vv[v[i]] = i; } cout << 2 * n + 1 << " "; long long ans = 0; int l = n - 1,r = 0; for(int i = 1; i <= n; i += 2) { int j = vv[n - i / 2]; l = min(l,j); r = max(r,j); ans += max(0,min(l,n - i) - max(0,r - i + 1) + 1); } l = vv[n]; r = vv[n]; for(int i = 2; i <= n; i += 2) { int j = vv[n - i / 2]; l = min(l,j); r = max(r,j); ans += max(0,min(l,n - i) - max(0,r - i + 1) + 1); } cout << ans << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int testNum = 1; //cin >> testNum; for(int i = 1; i <= testNum; i++) { solve(); } return 0; } |