제출 #1284378

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1284378		dobri_oke	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	1102 ms	200220 KiB

triusis

#include <bits/stdc++.h>
using namespace std;
#define w first
#define h second
#define pb push_back
#define int long long

const int N = 5e5+100;
int n, m;
int a[5100], dp[5100][5100];

void solve(){
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    for(int i = 0; i <= n; i++){
        for(int j = 0; j <= 5000; j++) dp[i][j]=1e18; 
    }
    dp[0][0] = 0;
    multiset < int > st;
    for(int i = 1; i <= n; i++){
        for(int j = max(0ll, a[i] - m); j <= 5000; j++) dp[i][a[i]] = min(dp[i][a[i]], dp[i-1][j]);
        for(int j = 0; j <= 5000; j++) st.insert(dp[i-1][j]);
        for(int j = 0; j <= m; j++){
            dp[i][j] = min(*st.begin() + 1, dp[i][j]);
        }
        for(int j = m + 1; j <= 5000; j++){
            st.erase(st.find(dp[i-1][j-m-1]));
            dp[i][j]=(*st.begin() + 1, dp[i][j]);
        }
        st.clear();
    }
    int ans = 1e18;
    for(int i = 0; i <= 5000; i++) ans = min(ans, dp[n][i]);
    cout << ans << '\n';
}

signed main(){   
    ios_base::sync_with_stdio(0);   cin.tie(0);
    //freopen("promote.in","r",stdin);
    //freopen("promote.out","w",stdout);
    int tt=1;
   // cin >> tt;
    while(tt--){
        solve();
    }
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37