Submission #1052064

#	Time	Username	Problem	Language	Result	Execution time	Memory
1052064		Sacharlemagne	Financial Report (JOI21_financial)	C++17	12 / 100	75 ms	3924 KiB

Main

#include <bits/stdc++.h>

using namespace std;

int main() {
    int n,d; cin >> n >> d;
    vector<int> v(n); for (int &i : v) cin >> i;
    vector<int> activate(n);
    stack<int> q;
    for (int i = 0; i<n; ++i) {
        while (!q.empty() && v[q.top()] < v[i]) q.pop();
        if (!q.empty())
            ++activate[q.top()];
        q.push(i);
    }
    int cur = 0, ans = 1;
    for (int i = n-1; i+1; --i) {
        cur -= activate[i]-1;
        ans = max(ans, cur);
    }
    cout << ans;
}

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