Maximum sum

input/code.cpp: In function 'int main()':
input/code.cpp:37:8: warning: unused variable 'val' [-Wunused-variable]
   37 |     ll val = -1000000;
      |        ^~~

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

#define all(x)  begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x)   (int)(x).size()                                 // signed size: avoids the unsigned .size() wrap bug

using ll  = long long;
using pii = pair<int,int>;
using vi  = vector<int>;

#ifdef LOCAL                                                    // compile with -DLOCAL to enable, silent on the judge
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "] = ", dbg_out(__VA_ARGS__)
template<class T> void dbg_out(T x) { cerr << x << '\n'; }
template<class T, class... R> void dbg_out(T x, R... r) { cerr << x << ", "; dbg_out(r...); }
#else
#define dbg(...)
#endif

int main() {
    cin.tie(0)->sync_with_stdio(0);                             // never mix with scanf/printf after this
    int n; cin >> n; 
    // int n,m; cin >> n >> m; 
    vi a(n); for (auto &x : a) cin >> x;

    vector<ll> s(n+1, 0);
    ll sum = 0;
    for (int i = 0; i < n; i++)
    {
        sum += a[i];
        s[i+1] = sum;
    }

    ll out = -1000000;

    int i = 0, j = 0;
    ll val = -1000000;
    while (i <= n && j <= n)
    {

        if (a[j] >= -a[i] || i == j || j > n){
            j += 1;
        } else{
            i += 1;
        }
        ll v1 = s[j] - s[i];
        // cout << v1 << " "<< i <<" "<<  j<< "\n";
        out = max(out, v1);

    }
    
    





    cout << out;
    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

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