| Task: | Maximum sum |
| Sender: | discape |
| Submission time: | 2025-09-15 16:54:03 +0300 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | ACCEPTED | 0.00 s | details |
| #4 | ACCEPTED | 0.00 s | details |
| #5 | ACCEPTED | 0.00 s | details |
| #6 | ACCEPTED | 0.02 s | details |
| #7 | ACCEPTED | 0.02 s | details |
| #8 | ACCEPTED | 0.03 s | details |
| #9 | ACCEPTED | 0.03 s | details |
| #10 | ACCEPTED | 0.04 s | details |
| #11 | ACCEPTED | 0.00 s | details |
| #12 | ACCEPTED | 0.00 s | details |
| #13 | ACCEPTED | 0.00 s | details |
| #14 | ACCEPTED | 0.00 s | details |
| #15 | ACCEPTED | 0.00 s | details |
Code
#include <bits/stdc++.h>
using namespace std;
// clang-format off
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
template <typename T> istream &operator>>(istream &is, vector<T> &v) { T value; is >> value; v.push_back(value); return is; }
#define preamble ios::sync_with_stdio(0); cin.tie(0); dbg("INIT");
// clang-format on
#ifdef DO_DBG
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<bool> vb;
typedef set<ll> si;
typedef pair<ll, ll> pi;
typedef vector<pair<ll, ll>> vpi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
const int MAX_N = 1e5 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;
#define loop(n) for (ll i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
int main() {
preamble;
ll n;
cin >> n;
vi x;
loop(n) cin >> x;
dbg(n, x);
ll top = -INF, sum = -INF;
for (ll i = 0; i < n; i++) {
sum = max(x[i] + sum, x[i]);
top = max(top, sum);
}
cout << top << "\n";
}
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 10 1 1 1 1 1 1 1 1 1 1 |
| correct output |
|---|
| 10 |
| user output |
|---|
| 10 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 10 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 10 24 7 -27 17 -67 65 -23 58 85 -... |
| correct output |
|---|
| 185 |
| user output |
|---|
| 185 |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 10 99 -59 31 83 -79 64 -20 -87 40... |
| correct output |
|---|
| 154 |
| user output |
|---|
| 154 |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 10 -19 61 60 33 67 19 -8 92 59 -3... |
| correct output |
|---|
| 383 |
| user output |
|---|
| 383 |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 200000 |
| user output |
|---|
| 200000 |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 200000 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 ... |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 200000 381082742 830199996 -85684827 ... |
| correct output |
|---|
| 231210956017 |
| user output |
|---|
| 231210956017 |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 200000 -935928962 -795492223 75287481... |
| correct output |
|---|
| 184607318819 |
| user output |
|---|
| 184607318819 |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 200000 524408131 613017181 -62281009 ... |
| correct output |
|---|
| 360019999220 |
| user output |
|---|
| 360019999220 |
Test 11
Verdict: ACCEPTED
| input |
|---|
| 1 1 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 12
Verdict: ACCEPTED
| input |
|---|
| 1 -2 |
| correct output |
|---|
| -2 |
| user output |
|---|
| -2 |
Test 13
Verdict: ACCEPTED
| input |
|---|
| 5 -1 -1 -1 -1 -2 |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 14
Verdict: ACCEPTED
| input |
|---|
| 2 -3 -2 |
| correct output |
|---|
| -2 |
| user output |
|---|
| -2 |
Test 15
Verdict: ACCEPTED
| input |
|---|
| 1 -1000000000 |
| correct output |
|---|
| -1000000000 |
| user output |
|---|
| -1000000000 |
