Submission #768877

#	Time	Username	Problem	Language	Result	Execution time	Memory
768877		LucaLucaM	Financial Report (JOI21_financial)	C++17	12 / 100	32 ms	8796 KiB

Main

#include <bits/stdc++.h>

using namespace std;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int n, d;
	cin >> n >> d;

	vector<int>dp(n + 1, 0);
	vector<int>suff(n + 2, 0);
	vector<int> a(n + 1);
	for (int i=1; i<=n; i++)
        cin >> a[i];
    stack<int>st;
    vector<int>nxt(n + 1, 0);
    for (int i=n; i>0; i--)
    {
        while (!st.empty() && a[i] >= a[st.top()])
            st.pop();
        nxt[i] = (st.empty()? n + 1 : st.top());
        st.push(i);
    }
    for (int i=n; i>0; i--)
    {
        suff[i] = max(suff[i+1], a[i]);
        dp[i] = dp[nxt[i]] + 1;
    }
    cout << *max_element(dp.begin(), dp.end());

	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