Maximum sum

#include <iostream>
#include <vector>

using namespace std;

int main() {
    int fline;
    int sline;
    std::vector<int> nums;
    cin >> fline;
    while (cin >> sline) {
        nums.push_back(sline);
    }
    

    int best = 0, sum = 0;
    for (int k = 0; k < fline; k++) {
    sum = max(nums[k],sum+nums[k]);
    best = max(best,sum);
    }
    cout << best;

  return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: ACCEPTED

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER