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