Submission #581599

#	Time	Username	Problem	Language	Result	Execution time	Memory
581599		colossal_pepe	Financial Report (JOI21_financial)	C++17	12 / 100	46 ms	4760 KiB

Main

#include <iostream>
#include <stack>
using namespace std;

const int N = 300005;

int n, d, a[N];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> d;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    int ans = 0;
    stack<int> s;
    for (int i = n - 1; i >= 0; i--) {
        while (not s.empty() and s.top() <= a[i]) s.pop();
        s.push(a[i]);
        ans = max(ans, (int)s.size());
    }
    cout << ans << '\n';
    return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 20
• Subtask 4: 12 / 12
• Subtask 5: 0 / 5
• Subtask 6: 0 / 35