Maximum sum

#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;




void t1(){
    int n, m, k;
    cin >> n >> m >> k;

    const int MOD = n * 100;

    vector<int> pos(k + 1, 0);
    vector<int> speed(k + 1, 0);


    vector<int> val(n);

    for(int i = 0; i < m; i++){
        int a;
        cin >> a;
        val[a] = 1;
    }

    int posC = 0;
    for(int i = 0; i < k; i++){
        if(val[posC] == 0){
            pos[i+1] = (pos[i] + 100) % MOD;
            posC +=1;
            posC %= n;
        } 
        else if(val[posC] == 1){
            pos[i+1] = (pos[i] + 200) % MOD;
            posC +=2;
            posC %= n;

        }
    }
    //for(int i = 0; i <= k; i++)
    //cout << i << pos[i] << endl;

    cout << pos[k] << endl;
}




void t2(){
    int n;
    cin >> n;
    vector<int> nums(n +1,0);
    for(int i = 0; i < n; i++){
        cin >> nums[i];
    }

    long long min = 0;
    //int minPos = 0;
    long long max = nums[0];
    //int maxPos = n-1;

    vector<int> dp(n,0);
    dp[0] = nums[0];

    for(int i = 1; i < n; i++){
       dp[i] += dp[i-1] + nums[i];

       
       if((dp[i] - min) > max){
           max = dp[i] - min;
           //maxPos = i;
       }
       if(dp[i] < min){
           min = dp[i];
          // minPos = i;
       }
    }

    /*if(minPos + 1 > n) min = dp[minPos -1];
    else if(minPos - 1 < 0) min = dp[minPos + 1];
    else if(dp[minPos + 1] > dp[minPos -1]){
        min = dp[minPos + 1];
    }
    else {
        min = dp[minPos - 1];
    }*/


    //int maxDiff = max - min;
    //int v = minPos+maxPos;
    //cout << max << "  " << min << endl;
    cout << max << endl;


}







int main() {
    t2();
    return 0;


}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 15

Verdict: ACCEPTED