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