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) {
  14.     int x = 1;
  15.     a %= M;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % M; 
  18.         a = (a * a) % M;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32.  
  33. //* Greedy soln
  34. int consistency1(int n){
  35.  
  36.     int maxi = -INF;
  37.     int sum = 0;
  38.     for(int i=0; i<n; i++){
  39.     	sum += a[i];
  40.     	maxi = max(maxi, sum);
  41.     	if(sum < 0) sum = 0;
  42.     }
  43.  
  44.     return maxi;
  45. }
  46.  
  47.  
  48. //* DP + Greedy soln 
  49. int consistency2(int n){
  50.  
  51.     int last = 0;
  52.     int maxi = -INF;
  53.     for(int i=0; i<n; i++){
  54.     	int curr = max(last+a[i] , a[i]);
  55.     	last = curr;
  56.     	maxi = max(maxi, curr);
  57.     }
  58.  
  59.  
  60.     return maxi;    
  61. }
  62.  
  63.  
  64. //* Bruteforce optimization 
  65. int consistency3(int n){
  66.     int maxi = -INF;
  67.  
  68. 	int sum = 0;
  69. 	int minSum = 0;
  70.  
  71. 	for(int i=0; i<n; i++){
  72. 		sum += a[i];
  73. 		maxi = max(maxi, sum - minSum);
  74.  
  75. 		minSum = min(minSum, sum);
  76. 	}
  77.  
  78.     return maxi;    
  79. }
  80.  
  81.  
  82.  
  83.  
  84.  
  85.  
  86.  
  87. int practice(int n){
  88.  
  89.  
  90.     return 0;
  91. }
  92.  
  93.  
  94.  
  95.  
  96.  
  97. void solve() {
  98.  
  99.     int n;
  100.     cin>> n;
  101.  
  102.     a.resize(n);
  103.     for(int i=0; i<n; i++) cin >> a[i];
  104.  
  105.     cout << consistency1(n) << " " << consistency2(n) << " " << consistency3(n) << endl;
  106.  
  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 0s 5320KB
comments (?)
stdin
copy 
9
-2 1 -3 4 -1 2 1 -5 4
stdout
copy 
6 6 6
https://ideone.com/rjiIB4
language:
C++14 (gcc 8.3)
created:
6 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!