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