Submission #771126

#	Time	Username	Problem	Language	Result	Execution time	Memory
771126		davitmarg	Financial Report (JOI21_financial)	C++17	0 / 100	4054 ms	5852 KiB

Main

/*
DavitMarg
In a honky-tonk,
Down in Mexico
*/
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <random>
#include <chrono>
#define mod 998244353ll
#define LL long long
#define LD long double
#define MP make_pair    
#define PB push_back
#define all(v) v.begin(), v.end()
#define fastIO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;

const int N = 500005;

int n, d;
int a[N];

void norm()
{
    vector<pair<int, int>> v;
    v.push_back(MP(-1, 0));
    for (int i = 1; i <= n; i++)
        v.push_back(MP(a[i], i));
    sort(all(v));
    for (int i = 1; i <= n; i++)
        if (v[i].first == v[i - 1].first)
            a[v[i].second] = a[v[i - 1].second];
        else
            a[v[i].second] = 1 + a[v[i - 1].second];
}

int dp[N], lst[N];

void solve()
{
    cin >> n >> d;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    norm();

    vector<int> st;
    a[0] = -mod;
    st.push_back(0);

    lst[0] = 1;

    for (int i = 1; i <= n; i++)
    {
        lst[i] = max(1, i - d);
        while (a[st.back()] > a[i])
			st.pop_back();
		if(i - st.back() <= d)
            lst[i] = lst[st.back()];
        st.push_back(i);
    }

    for (int i = 1; i <= n; i++)
        for(int j = i - 1; j >= lst[i]; j--)
			if(a[i] > a[j])
                dp[i] = max(dp[i], dp[j] + 1);

    int ans = 1;
    for(int i = lst[n]; i <= n; i++)
		ans = max(ans, dp[i]);

    cout << ans + 1<< endl;
}


int main()
{
    fastIO;
    int T = 1;
    //cin >> T;
    while (T--)
    {
        solve();
    }

    return 0;
}

/*


*/

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