Maximum sum

#include <bits/stdc++.h>
using namespace std;

int main() {
    long n;
    cin >> n;
    vector<long> v;
    for (long i = 0; i < n; i++) {
        long t;
        cin >> t;
        v.push_back(t);
    }

    long long max = 0;
    for (long i = 0; i < n; i++) {
        long j = 0;
        long k = i;
        long long currSum = 0;
        for (long p = j; p <= k; p++) currSum += v[p];
        if (currSum > max) max = currSum;
        for (; k < n; j++, k++) {
            if (j == 0) continue;
            currSum -= v[j-1];
            currSum += v[k];
            if (currSum > max) max = currSum;
        }
    }

    cout << max;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER