/******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include <bits/stdc++.h>
using namespace std;
std::vector<int>dane;
std::vector<int>kolejka;
std::vector<int> nastepne;
int main()
{
int n;
cin >> n;
for (int i = 0;i< n ; i++){
int x;
std::cin >> x;
dane.push_back(x);
nastepne.push_back(2*n);
}
for (int i = 0;i< n ; i++){
dane.push_back(dane[i]);
nastepne.push_back(2*n);
}
for (int i = 2 * n -1;i>= 0; i--){
while(not kolejka.empty() and dane[kolejka.back()] <= dane[i]){
kolejka.pop_back();
}
if(not kolejka.empty()){
nastepne[i] = kolejka.back();
}
kolejka.push_back(i);
}
int wynik = 1;
for (int start = 0; start < n; start++) {
int limit = start + n;
int cur = start;
int ile = 1;
while (nastepne[cur] < limit) {
cur = nastepne[cur];
ile++;
}
wynik = max(wynik, ile);
}
cout << wynik << "\n";
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 | /****************************************************************************** Online C++ Compiler. Code, Compile, Run and Debug C++ program online. Write your code in this editor and press "Run" button to compile and execute it. *******************************************************************************/ #include <bits/stdc++.h> using namespace std; std::vector<int>dane; std::vector<int>kolejka; std::vector<int> nastepne; int main() { int n; cin >> n; for (int i = 0;i< n ; i++){ int x; std::cin >> x; dane.push_back(x); nastepne.push_back(2*n); } for (int i = 0;i< n ; i++){ dane.push_back(dane[i]); nastepne.push_back(2*n); } for (int i = 2 * n -1;i>= 0; i--){ while(not kolejka.empty() and dane[kolejka.back()] <= dane[i]){ kolejka.pop_back(); } if(not kolejka.empty()){ nastepne[i] = kolejka.back(); } kolejka.push_back(i); } int wynik = 1; for (int start = 0; start < n; start++) { int limit = start + n; int cur = start; int ile = 1; while (nastepne[cur] < limit) { cur = nastepne[cur]; ile++; } wynik = max(wynik, ile); } cout << wynik << "\n"; return 0; } |
English