fork download
copy 
  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.  
  33. int consistency(int n, int k, int p){
  34. 	if(k==0) return 0;
  35.  
  36. 	vector<vector<vector<int>>> dp(n, vector<vector<int>>(k+1, vector<int>(2, -INF)));
  37. 	for(int i=0; i<n; i++){
  38. 		dp[i][0][1] = 0;
  39. 	}
  40.  
  41. 	int maxi = -INF;
  42. 	for(int i=0; i<n; i++){
  43. 		//* 0 => Selecting i-th  so a[i] is selected
  44. 		dp[i][1][0] = a[i];
  45.  
  46.  
  47. 		//* 1 => Not selecting i-th  so maximum in [1: i-1]
  48. 		//* So we set dp before updating maxi
  49. 		dp[i][1][1] = maxi;
  50.  
  51. 		maxi = max(maxi, a[i]);
  52. 	}
  53.  
  54. 	for(int j=2; j<=k; j++){
  55. 		for(int i=0; i<n; i++){
  56.  
  57. 			if(i-2>=0) dp[i][j][0] = max(dp[i][j][0] , a[i] + max(dp[i-2][j-1][0], dp[i-2][j-1][1]) );
  58. 			if(i-1>=0) dp[i][j][0] = max(dp[i][j][0], a[i] + dp[i-1][j-1][0] - p);
  59.  
  60. 			if(i-1>=0) dp[i][j][1] = max(dp[i-1][j][0], dp[i-1][j][1]);
  61. 		}
  62. 	}
  63.  
  64. 	return max( dp[n-1][k][0], dp[n-1][k][1] );
  65. }
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81.  
  82.  
  83.  
  84.  
  85. int practice(int n, int k, int p){
  86.  
  87.  
  88.     return 0;
  89. }
  90.  
  91.  
  92.  
  93.  
  94.  
  95. void solve() {
  96.  
  97.     int n, k, p;
  98.     cin>> n >> k >> p;
  99.  
  100.     a.resize(n);
  101.     for(int i=0; i<n; i++) cin >> a[i];
  102.  
  103.     cout << consistency(n, k, p) << endl;
  104.  
  105.  
  106. }
  107.  
  108.  
  109.  
  110.  
  111.  
  112. int32_t main() {
  113.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  114.  
  115.     int t = 1;
  116.     cin >> t;
  117.     while (t--) {
  118.         solve();
  119.     }
  120.  
  121.     return 0;
  122. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
3
7 2 5
5 -8 3 1 2 -4 -5
7 3 5
5 -8 3 1 2 -4 -5
7 4 5
5 -8 3 1 2 -4 -5
stdout
copy 
8
10
5
https://ideone.com/S8eY5W
language:
C++14 (gcc 8.3)
created:
5 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!