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