#include<bits/stdc++.h> #define ll long long #define pii pair<int, int> #define st first #define nd second #define turbo ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define pb push_back #define vi vector<int> #define vvi vector<vi> #define qi queue<int> #define ld long double using namespace std; /*---------------------------------------------------------///CODE///---------------------------------------------------------*/ int main() { turbo int n; cin >> n; vi v(n); for(int i = 0; i < n; i++) { int x; cin >> x; v[x - 1] = i; } ll res = 0; int l = v[n - 1], r = v[n - 1]; int wsk = n - 1; while(wsk >= 0) { if(wsk && v[wsk - 1] >= l && v[wsk - 1] <= r) { wsk --; continue; } int suf = n - wsk, dl = r - l + 1; if(!wsk) { res ++; break; } if(wsk) { int ilem = 2*suf - dl - 1; int ilel = (v[wsk - 1] < l ? l - v[wsk - 1] - 1 : l); int iler = (v[wsk - 1] > r ? v[wsk - 1] - r - 1 : n - r - 1); if(ilel < iler) { for(int i = 0; i <= min(ilem, ilel); i++) res += min(ilem - i, iler) + 1; } else { for(int i = 0; i <= min(ilem, iler); i++) res += min(ilem - i, ilel) + 1; } } if(v[wsk - 1] < l) l = v[wsk - 1]; else r = v[wsk - 1]; wsk --; } cout << 2*n + 1 << " " << res; 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 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 | #include<bits/stdc++.h> #define ll long long #define pii pair<int, int> #define st first #define nd second #define turbo ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define pb push_back #define vi vector<int> #define vvi vector<vi> #define qi queue<int> #define ld long double using namespace std; /*---------------------------------------------------------///CODE///---------------------------------------------------------*/ int main() { turbo int n; cin >> n; vi v(n); for(int i = 0; i < n; i++) { int x; cin >> x; v[x - 1] = i; } ll res = 0; int l = v[n - 1], r = v[n - 1]; int wsk = n - 1; while(wsk >= 0) { if(wsk && v[wsk - 1] >= l && v[wsk - 1] <= r) { wsk --; continue; } int suf = n - wsk, dl = r - l + 1; if(!wsk) { res ++; break; } if(wsk) { int ilem = 2*suf - dl - 1; int ilel = (v[wsk - 1] < l ? l - v[wsk - 1] - 1 : l); int iler = (v[wsk - 1] > r ? v[wsk - 1] - r - 1 : n - r - 1); if(ilel < iler) { for(int i = 0; i <= min(ilem, ilel); i++) res += min(ilem - i, iler) + 1; } else { for(int i = 0; i <= min(ilem, iler); i++) res += min(ilem - i, ilel) + 1; } } if(v[wsk - 1] < l) l = v[wsk - 1]; else r = v[wsk - 1]; wsk --; } cout << 2*n + 1 << " " << res; return 0; } |