fork download
copy 
  1. #include <bits/stdc++.h>
  2. #include <ext/pb_ds/assoc_container.hpp>
  3. #include <ext/pb_ds/tree_policy.hpp>
  4.  
  5. using namespace std;
  6. using namespace __gnu_pbds;
  7. using ll = long long;
  8. using ld = long double;
  9.  
  10. #define all(x)  x.begin(),x.end()
  11. #define v(x) vector<x>
  12. #define nl '\n'
  13. #define fxd(x) fixed << setprecision(x)
  14. template<class t> using ordered_set = tree<t, null_type, less<t>, rb_tree_tag, tree_order_statistics_node_update>;
  15. template<class t> using ordered_multiset = tree<t, null_type, less_equal<t>, rb_tree_tag, tree_order_statistics_node_update>;
  16.  
  17.  
  18. int main()
  19. {
  20.     ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
  21.     int n; cin >> n;
  22.     v(ll) arr(n+1);
  23.     for (int i = 1; i <= n; i++)
  24.     {
  25.         cin >> arr[i];
  26.     }
  27.     v(ll) prefsum(n+1,0);
  28.     for (int i = 1; i <= n; i++)
  29.     {
  30.         prefsum[i] = prefsum[i-1] + arr[i];
  31.     }
  32.     v(ll) minprefsum(n+1,0);
  33.     for (int i = 1; i <= n; i++)
  34.     {
  35.         minprefsum[i] = min(prefsum[i],minprefsum[i-1]);
  36.     }
  37.     ll mx = -1e17;
  38.     for (int i = 1; i <= n; i++)
  39.     {
  40.         if(prefsum[i] == minprefsum[i])
  41.         {
  42.             mx = max(mx,arr[i]);
  43.         }
  44.         else
  45.         {
  46.             mx = max(mx,prefsum[i]-minprefsum[i]);
  47.         }
  48.     }
  49.     cout << mx;
  50.  
  51. }
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/u3wKO9
language:
C++ (gcc 8.3)
created:
4 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!