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 consistency1(int n, int x){
  33. 	if(n==1) return -INF;
  34. 	if(n==1 && x==1) return a[0]-a[1];
  35. 	if(n==1) return -INF;
  36.  
  37. 	vector<vector<int>> dp(n+1, vector<int>(x+1, -INF));
  38. 	dp[0][0] = 0;
  39. 	dp[2][1] = a[0] - a[1];
  40.  
  41.  
  42. 	for(int i=3; i<=n; i++){
  43.  
  44. 		for(int k=1; k<=x; k++){
  45.  
  46. 			int j = i-2;
  47. 			while(j>=0){
  48. 				dp[i][k] = max(dp[i][k], dp[j][k-1] + ( a[j] - a[i-1]));
  49. 				j--;
  50. 			}
  51. 		}
  52. 	}
  53.  
  54. 	return dp[n][x];
  55. }
  56.  
  57.  
  58.  
  59. int consistency2(int n, int x){
  60. 	if(n==1) return -INF;
  61. 	if(n==1 && x==1) return a[0]-a[1];
  62. 	if(n==1) return -INF;
  63.  
  64. 	vector<vector<int>> dp(n+1, vector<int>(x+1, -INF));
  65. 	dp[0][0] = 0;
  66.  
  67.  
  68. 	for(int k=1; k<=x; k++){
  69.  
  70. 		int maxSoFar = -INF;
  71.  
  72. 		for(int i=2; i<=n; i++){
  73.  
  74. 			if(dp[i-2][k-1] != -INF){
  75. 				maxSoFar = max(maxSoFar, dp[i-2][k-1] + a[i-2]);
  76. 			}
  77.  
  78. 			if(maxSoFar != -INF) dp[i][k] = maxSoFar - a[i-1];
  79. 		}
  80. 	}
  81.  
  82.  
  83.  
  84. 	return dp[n][x];
  85. }
  86.  
  87.  
  88.  
  89.  
  90.  
  91.  
  92.  
  93.  
  94.  
  95.  
  96.  
  97.  
  98. int practice(int n, int x){
  99.  
  100.  
  101.     return 0;
  102. }
  103.  
  104.  
  105.  
  106.  
  107.  
  108. void solve() {
  109.  
  110.     int n, k;
  111.     cin>> n >> k;
  112.  
  113.     a.resize(n);
  114.     for(int i=0; i<n; i++) cin >> a[i];
  115.  
  116.     cout << consistency1(n, k) << " " << consistency2(n, k) << endl;
  117.  
  118.  
  119. }
  120.  
  121.  
  122.  
  123.  
  124.  
  125. int32_t main() {
  126.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  127.  
  128.     int t = 1;
  129.     // cin >> t;
  130.     while (t--) {
  131.         solve();
  132.     }
  133.  
  134.     return 0;
  135. }
Success #stdin #stdout 0s 5320KB
comments (?)
stdin 
8 3
5 10 5 10 1 1 8 2
stdout 
15 15
https://ideone.com/M6JyOS
language:
C++14 (gcc 8.3)
created:
6 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!