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