/**
* author: MINHTPC
*
**/
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(a) a.begin() , a.end()
#define FOR(i ,a , b) for(int i = a ; i <= b ; ++i)
#define bit(mask,i) ((mask>>i)&1)
#define name "task"
#define lo lower_bound
#define up upper_bound
#define count_bit1(x) __builtin_popcountll(x)
#define count_bit01(x) __builtin_clzll(x)
#define count_bit10(x) __builtin_ctzll(x)
using namespace std;
long long n,k;
namespace sub2 {
const int N=5e3+5;
const long long INF=1e18;
long long dp[N][N],a[N];
void solve() {
for(int i=1;i<=n;i++) cin >> a[i];
for(int i=0;i<k;i++) dp[1][i]=1;
for(int i=1;i<=n;i++) dp[i][k]=INF;
for(int i=2;i<=n;i++) {
for(int j=0;j<k;j++) {
dp[i][j]=min(dp[i-1][j+1]+1,dp[i-1][j]+a[i]-a[i-1]);
}
}
long long ans=INF;
for(int i=0;i<=k;i++) ans=min(ans,dp[n][i]);
cout << ans << '\n';
}
}
namespace sub_full {
const int N=1e5+5;
priority_queue<ll>q;
long long a[N];
void slove() {
for(int i=1;i<=n;i++) cin >> a[i];
for(int i=2;i<=n;i++) q.push(a[i]-a[i-1]-1);
ll ans=a[n]-a[1]+1;
for(int i=1;i<=n-k;i++) {
ans-=q.top();
q.pop();
}
cout << ans << '\n';
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin >> n >> k;
if(n<=5000) sub2::solve();
else sub_full::slove();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |