fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. int consistency(int n, int k){
  33.  
  34. vector<vector<int>> dp(n+1, vector<int>(k+1, INF));
  35.  
  36. dp[0][0] = 0;
  37.  
  38. for(int i=1; i<=n; i++){
  39.  
  40. for(int x=1; x<=k; x++){
  41.  
  42. int j = i-1;
  43. int maxi = a[i-1];
  44. while(j>=0){
  45.  
  46. dp[i][x] = min(dp[i][x] , dp[j][x-1] + maxi);
  47.  
  48. if(j-1>=0) maxi = max(maxi, a[j-1]);
  49. j--;
  50. }
  51. }
  52. }
  53.  
  54. return dp[n][k];
  55. }
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71. int practice(int n, int k){
  72.  
  73.  
  74. return 0;
  75. }
  76.  
  77.  
  78.  
  79.  
  80.  
  81. void solve() {
  82.  
  83. int n, k;
  84. cin>> n >> k;
  85.  
  86. a.resize(n);
  87. for(int i=0; i<n; i++) cin >> a[i];
  88.  
  89. cout << consistency(n, k) << endl;
  90.  
  91.  
  92. }
  93.  
  94.  
  95.  
  96.  
  97.  
  98. int32_t main() {
  99. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  100.  
  101. int t = 1;
  102. // cin >> t;
  103. while (t--) {
  104. solve();
  105. }
  106.  
  107. return 0;
  108. }
Success #stdin #stdout 0s 5316KB
stdin
5 2
10 5 8 15 18 
stdout
28