fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. inline int power(int a, int b) {
  6.     int x = 1;
  7.     while (b) {
  8.         if (b & 1) x *= a;
  9.         a *= a;
  10.         b >>= 1;
  11.     }
  12.     return x;
  13. }
  14.  
  15.  
  16. const int M = 1000000007;
  17. const int N = 3e5+9;
  18. const int INF = 2e9+1;
  19. const int LINF = 2000000000000000001;
  20.  
  21. //_ ***************************** START Below *******************************
  22.  
  23.  
  24.  
  25. //* Kadanes Algo : 
  26.  
  27. //* Prefix[R] = max sum subarray ending at R
  28. //* Prefix[R] = max(Prefix[R-1] + a[R], a[R]);
  29.  
  30. //* In case of Max +ve sum subarray : 
  31. //* Prefix[R] = max( Prefix[R-1] + a[R], a[R], 0 )
  32.  
  33.  
  34.  
  35. vector<int> a;
  36. void  consistency(int n) {
  37.  
  38.     int prev = 0;
  39.  
  40. 	//* Negative sum allowed here 
  41.     int maxi = INT32_MIN; 
  42.     vector<int> Prefix(n);
  43.  
  44.     for(int i = 0; i < n; i++){
  45.         int curr = max(a[i], prev + a[i]);
  46.         prev = curr;
  47.         maxi = max(maxi, curr);
  48.     	Prefix[i] = maxi;   
  49.     }
  50.  
  51.     cout << maxi << endl;
  52. }
  53.  
  54. void solve() {
  55.  
  56. 	int n;
  57. 	cin >> n;
  58. 	a.resize(n);
  59. 	for(int i=0; i<n; i++) cin >> a[i];
  60.  
  61. 	consistency(n);
  62.  
  63. }
  64.  
  65.  
  66.  
  67.  
  68.  
  69. int32_t main() {
  70.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  71.  
  72.     int t = 1;
  73.     cin >> t;
  74.     while (t--) {
  75.         solve();
  76.     }
  77.  
  78.     return 0;
  79. }
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin
copy 
2
1
-1
9
-2 1 -3 4 -1 2 1 -5 4
stdout
copy 
-1
6
https://ideone.com/9Jnj1K
language:
C++14 (gcc 8.3)
created:
10 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!