제출 #129115

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
129115		miguel	Stove (JOI18_stove)	C++14	50 / 100	103 ms	47480 KiB

stove

#include<bits/stdc++.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <int, pi>
#define vi vector <int>
const ll mod = 1e9 + 7;
int n, k, dp[5001][5001], t[5005];

int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    cin>>n>>k;
    for(int i=1; i<=n; i++) cin>>t[i];
    for(int i=1; i<=n; i++){
        for(int j=1; j<=k; j++) dp[i][j]=1e9;
    }
    dp[1][1]=1;
    for(int i=2; i<=n; i++) dp[i][1]=t[i]-t[1]+1;
    for(int i=1; i<=n; i++){
        for(int cnt=2; cnt<=min(i, k); cnt++){
            dp[i][cnt]=min(dp[i-1][cnt-1]+1, dp[i-1][cnt]+t[i]-t[i-1]);
        }
    }
    /*for(int i=1; i<=n; i++){
        for(int j=1; j<=k; j++) cout<<dp[i][j]<<" ";cout<<endl;
    }*/
    cout<<dp[n][k];
}

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 0 / 50