제출 #654158

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
654158		Farbod	Financial Report (JOI21_financial)	C++17	12 / 100	808 ms	5348 KiB

Main

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

const int N = 3e5 + 1;

int n, d, a[N], ans = 1;
vector <int> v;

signed main()
{
    cin >> n >> d;
    for (int i = 0; i < n; i++)
        cin >> a[i];

    for (int i = n - 1; i >= 0; i--) {
        while (v.size() && a[v.back()] <= a[i])
            v.pop_back();
        v.push_back(i);

        cerr << v.size() << '\n';

        ans = max(ans, (int)v.size());
    }

    cout << ans;

    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