Maximum sum

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <deque>

using namespace std;

int main()
{
    int n_numbers;
    cin >> n_numbers;

    vector<int> storage;
    vector<int> result(n_numbers, 0);

    for (int i = 0; i < n_numbers; ++i)
    {
        int temp;
        cin >> temp;
        storage.push_back(temp);
    }

    result[0] = storage[0];

    for(int i = 1; i < n_numbers; ++i)
    {
        if(result[i - 1] + storage[i] >= storage[i])
        {
            result[i] = result[i - 1] + storage[i];
        }
        else
        {
            result[i] = storage[i];
        }
    }



    cout << *(max_element(result.begin(), result.end())) << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED