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. int consistency1(int n, int m){
  33.  
  34. 	vector<int> dp(n+1, -INF);
  35. 	dp[0] = 0;
  36.  
  37. 	for(int i=m; i<=n; i++){
  38.  
  39. 		int sum = 0;
  40. 		int j = i;
  41. 		while(j>=i-m+1){
  42. 			sum += a[j-1];
  43. 			j--;
  44. 		}
  45.  
  46. 		while(j>=0){
  47. 			dp[i] = max(dp[i] , dp[j] + sum );
  48. 			j--;
  49. 		}
  50. 	}
  51.  
  52. 	int maxi = -INF;
  53. 	for(int i=1; i<=n; i++){
  54. 		maxi = max(maxi, dp[i]);
  55. 	}
  56.  
  57. 	return maxi;
  58. }
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66. int consistency2(int n, int m){
  67.  
  68. 	vector<int> dp(n+1, -INF);
  69. 	vector<int> pMaxi(n+1, 0);
  70. 	dp[0] = 0;
  71.  
  72. 	int sum = 0;
  73. 	for(int i=1, j=1; i<=n; i++){
  74. 		sum += a[i-1];
  75.  
  76. 		if(i-j == m){
  77. 			sum -= a[j-1];
  78. 			j++;
  79. 		}		
  80.  
  81. 		if(i-j+1 == m){
  82. 			dp[i] = pMaxi[j-1] + sum;
  83. 			pMaxi[i] = max(pMaxi[i-1], dp[i]);
  84. 		}
  85. 	}
  86.  
  87.  
  88. 	return pMaxi[n];
  89. }
  90.  
  91.  
  92.  
  93.  
  94. //? Approach 2 : 
  95.  
  96. int consistency3(int n, int m){
  97.  
  98. 	vector<int> dp(n);
  99.  
  100. 	int sum = 0;
  101. 	for(int i=0, j=0; i<n; i++){
  102. 		sum += a[i];
  103.  
  104. 		if(i-j == m){
  105. 			sum -= a[j];
  106. 			j++;
  107. 		}		
  108.  
  109. 		if(i-j+1 == m){
  110. 			dp[i] = dp[i-1];
  111. 			if(j-1>=0) dp[i] = max(dp[i], dp[j-1]+sum);
  112. 			else  dp[i] = max(dp[i], sum);
  113. 		}
  114. 	}
  115.  
  116.  
  117. 	return dp[n-1];
  118. }
  119.  
  120.  
  121.  
  122.  
  123.  
  124.  
  125.  
  126.  
  127.  
  128.  
  129.  
  130. int practice(int n, int m){
  131.  
  132.  
  133.     return 0;
  134. }
  135.  
  136.  
  137.  
  138.  
  139.  
  140. void solve() {
  141.  
  142.     int n, m;
  143.     cin>> n >> m;
  144.  
  145.     a.resize(n);
  146.     for(int i=0; i<n; i++) cin >> a[i];
  147.  
  148.     cout << consistency1(n, m) << " " << consistency2(n, m) << " " << consistency3(n, m) << endl;
  149.  
  150.  
  151. }
  152.  
  153.  
  154.  
  155.  
  156.  
  157. int32_t main() {
  158.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  159.  
  160.     int t = 1;
  161.     // cin >> t;
  162.     while (t--) {
  163.         solve();
  164.     }
  165.  
  166.     return 0;
  167. }
Success #stdin #stdout 0s 5336KB
comments (?)
stdin
copy 
8 2
8 10 -5 -8 1 10 10 11
stdout
copy 
50 50 50
https://ideone.com/Tv3R7x
language:
C++14 (gcc 8.3)
created:
3 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!