Submission #1225498

#TimeUsernameProblemLanguageResultExecution timeMemory
1225498prism7kFinancial Report (JOI21_financial)C++20
12 / 100
70 ms2632 KiB
#include <bits/stdc++.h> using namespace std; int main() { int N, D; cin >> N >> D; vector<int> a(N); for(int &b : a) cin >> b; reverse(a.begin(), a.end()); stack<int> s; int mx = 0; for(int i = 0; i < N; ++i) { while(!s.empty() && a[i] >= s.top()) s.pop(); s.push(a[i]); mx = max(mx, (int)s.size()); } cout << mx << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...