#include <bits/stdc++.h> using namespace std; int main() { std::ios_base::sync_with_stdio(false); int n; cin >> n; vector<int> ratings; ratings.reserve(n+1); for(int i = 0; i < n+1; i++) ratings.push_back(0); for(int i = 0; i < n; i++){ int rating; cin >> rating; ratings[rating] = i; } long long result = 1; int prevLength = 1; int maxCounter = 1; int begin = ratings[n], end = ratings[n]; // cout<<begin<<" - "<<end<<endl; for(int i = ratings.size()-2; i >= ratings.size()/2; i--) { if(ratings[i] > end or ratings[i] < begin){ // result++; begin = min(begin, ratings[i]); end = max(end, ratings[i]); } // cout<<i<<" na pozycji: "<<ratings[i]<<endl; // cout<<begin<<" - "<<end<<endl; maxCounter++; int currentSectionLength = end - begin + 1; int canBeAdded = 2*maxCounter - 1 - currentSectionLength; if(canBeAdded < 0) continue; int minToAdd = max(0, prevLength - currentSectionLength+1); for(int j = minToAdd; j <= canBeAdded; j++) { if(n-end -1 + begin < j) continue; int maxToAddLeft = begin; int maxToAddRight = n - end - 1; int minToAddOnOneSide = max(0, j - max(maxToAddLeft, maxToAddRight)); if(maxToAddLeft >= j and maxToAddRight >= j) result += j + 1; else result += max(min(maxToAddRight, maxToAddLeft) - minToAddOnOneSide + 1, 0); // cout<<"new result: "<<result<< " " << j<<endl; } prevLength = 2*maxCounter - 1; } cout<<2*n+1<<" "<<result<<endl; 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 | #include <bits/stdc++.h> using namespace std; int main() { std::ios_base::sync_with_stdio(false); int n; cin >> n; vector<int> ratings; ratings.reserve(n+1); for(int i = 0; i < n+1; i++) ratings.push_back(0); for(int i = 0; i < n; i++){ int rating; cin >> rating; ratings[rating] = i; } long long result = 1; int prevLength = 1; int maxCounter = 1; int begin = ratings[n], end = ratings[n]; // cout<<begin<<" - "<<end<<endl; for(int i = ratings.size()-2; i >= ratings.size()/2; i--) { if(ratings[i] > end or ratings[i] < begin){ // result++; begin = min(begin, ratings[i]); end = max(end, ratings[i]); } // cout<<i<<" na pozycji: "<<ratings[i]<<endl; // cout<<begin<<" - "<<end<<endl; maxCounter++; int currentSectionLength = end - begin + 1; int canBeAdded = 2*maxCounter - 1 - currentSectionLength; if(canBeAdded < 0) continue; int minToAdd = max(0, prevLength - currentSectionLength+1); for(int j = minToAdd; j <= canBeAdded; j++) { if(n-end -1 + begin < j) continue; int maxToAddLeft = begin; int maxToAddRight = n - end - 1; int minToAddOnOneSide = max(0, j - max(maxToAddLeft, maxToAddRight)); if(maxToAddLeft >= j and maxToAddRight >= j) result += j + 1; else result += max(min(maxToAddRight, maxToAddLeft) - minToAddOnOneSide + 1, 0); // cout<<"new result: "<<result<< " " << j<<endl; } prevLength = 2*maxCounter - 1; } cout<<2*n+1<<" "<<result<<endl; return 0; } |