cses

solution to cses exercise problems
git clone git://git.superpozycja.net/cses
Log | Files | Refs | README

max_subarray_sum.cpp (576B)

      1 #include <bits/stdc++.h>
      2 
      3 using namespace std;
      4 
      5 using ui = unsigned int;
      6 using l = long;
      7 using ul = unsigned long;
      8 using ll = long long;
      9 using ull = unsigned long long;
     10 
     11 using vi = vector<int>;
     12 using vui = vector<ui>;
     13 using vl = vector<l>;
     14 using vul = vector<ul>;
     15 using vll = vector<ll>;
     16 using vull = vector<ull>;
     17 
     18 void solve()
     19 {
     20 	int n;
     21 	cin >> n;
     22 	long res = -1000000000, s = -1000000000;
     23 	for (int i = 0; i < n; i++) {
     24 		long t;
     25 		cin >> t;
     26 		s = max(s+t, t);
     27 		res = max(s, res);
     28 	}
     29 	cout << res << "\n";
     30 }
     31 
     32 int main()
     33 {
     34 	ios::sync_with_stdio(0);
     35 	cin.tie(0);
     36 	solve();
     37 }