Submission #738854

#	Time	Username	Problem	Language	Result	Execution time	Memory
738854		veehj	Financial Report (JOI21_financial)	C++17	28 / 100	4093 ms	1048576 KiB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define sz(a) (int)a.size()
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()

int main() {
    ll n, d; cin >> n >> d;
    vector<ll> a(n); for(auto& u : a) cin >> u;
    vector<map<ll, ll>> mp(n); //v[place][max]=ans
    mp[0][a[0]]=1;
    for(ll i=1; i<n; i++){
        mp[i][a[i]]=1;
        for(ll j=1; j<=d; j++){
            if(i>=j){
                for(auto& u : mp[i-j]){
                    if(u.F>=a[i]){
                        mp[i][u.F]=max(mp[i][u.F], u.S);
                    }
                    else{
                        mp[i][a[i]]=max(mp[i][a[i]], u.S+1);
                    }
                }
            }
        }
    }
    ll ans=0;
    for(auto& u : mp[n-1]) ans=max(ans, u.S);
    cout << ans << endl;
}

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