Submission details
Task:Maximum sum
Sender:Giaco
Submission time:2025-09-15 16:44:49 +0300
Language:Rust (2021)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.01 sdetails
#7ACCEPTED0.01 sdetails
#8ACCEPTED0.02 sdetails
#9ACCEPTED0.02 sdetails
#10ACCEPTED0.02 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails

Compiler report

warning: unused import: `min`
 --> input/code.rs:1:21
  |
1 | use std::cmp::{max, min};
  |                     ^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: unused import: `std::collections::VecDeque`
 --> input/code.rs:2:5
  |
2 | use std::collections::VecDeque;
  |     ^^^^^^^^^^^^^^^^^^^^^^^^^^

warning: 2 warnings emitted

Code

use std::cmp::{max, min};
use std::collections::VecDeque;
use std::io::{self, Read};

macro_rules! input {
    ($it: expr) => {
        $it.next().unwrap().parse().unwrap()
    };
    ($it: expr, $T: ty) => {
        $it.next().unwrap().parse::<$T>().unwrap()
    };
}
/*
mod classes;
mod homework;

fn main() {
    // println!("{}", "-".repeat(20));
    classes::c05::task2();
    // homework::hw2::task2();
    // println!("{}", "-".repeat(20));
}
// */

fn main() {
    let mut buf = String::new();
    io::stdin().read_to_string(&mut buf).unwrap();

    let mut it = buf.split_whitespace();

    let n: i128 = input!(it);

    let v: Vec<i128> = (0..n).map(|_| input!(it)).collect();

    let mut sum = 0;
    let mut max_so_far = v[0];

    for x in v {
        if sum<0 {
            sum = 0;
        }
        sum+=x;
        max_so_far = max(sum, max_so_far);
    }
    println!("{}", max_so_far);
}


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