Wheel of fortune

input/code.cpp: In function 'int main()':
input/code.cpp:14:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     for (int i = 0; i < vals.size(); i++)
      |                     ~~^~~~~~~~~~~~~
input/code.cpp:27:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for (int i = 1; i < vals.size(); i++)
      |                     ~~^~~~~~~~~~~~~
input/code.cpp:42:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for (int i = 1; i < vals.size(); i++)
      |                     ~~^~~~~~~~~~~~~
input/code.cpp:57:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [...

// Online C++ compiler to run C++ program online
#include <iostream>
#include <vector>
#include <climits>

using namespace std;

int main() {
    
    int n;
    cin >> n;
    
    vector<int> vals(n);
    for (int i = 0; i < vals.size(); i++)
        cin >> vals[i];
    
    // Green, red, black
    // (ignore, lose, win)
    vector<vector<long long>> table = vector<vector<long long>>(n, vector<long long>(3, INT_MIN));
    
    long long maxRes = INT_MIN;
    
    table[0][0] = 0;
    table[0][1] = INT_MIN;
    table[0][2] = INT_MIN;
    
    for (int i = 1; i < vals.size(); i++)
    {
        table[i][0] = max(table[i-1][1], table[i-1][2]);
        table[i][1] = max(table[i-1][0], table[i-1][2]) - vals[i];
        table[i][2] = max(table[i-1][0], table[i-1][1]) + vals[i];
        //cout << "Table1: " << table[i][0] << " " << table[i][1] << " " << table[i][2] << endl;
    }
    
    maxRes = max(maxRes, max(table[vals.size()-1][1], table[vals.size()-1][2]));
    
    
    table[0][0] = INT_MIN;
    table[0][1] = -vals[0];
    table[0][2] = INT_MIN;
    
    for (int i = 1; i < vals.size(); i++)
    {
        table[i][0] = max(table[i-1][1], table[i-1][2]);
        table[i][1] = max(table[i-1][0], table[i-1][2]) - vals[i];
        table[i][2] = max(table[i-1][0], table[i-1][1]) + vals[i];
        //cout << "Table2: " << table[i][0] << " " << table[i][1] << " " << table[i][2] << endl;
    }
    
    maxRes = max(maxRes, max(table[vals.size()-1][0], table[vals.size()-1][2]));
    
    
    table[0][0] = INT_MIN;
    table[0][1] = INT_MIN;
    table[0][2] = vals[0];
    
    for (int i = 1; i < vals.size(); i++)
    {
        table[i][0] = max(table[i-1][1], table[i-1][2]);
        table[i][1] = max(table[i-1][0], table[i-1][2]) - vals[i];
        table[i][2] = max(table[i-1][0], table[i-1][1]) + vals[i];
        //cout << "Table3: " << table[i][0] << " " << table[i][1] << " " << table[i][2] << endl;
    }
    
    maxRes = max(maxRes, max(table[vals.size()-1][0], table[vals.size()-1][1]));
    
    cout << maxRes;

    return 0;
}

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: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED

Test 63

Verdict: ACCEPTED

Test 64

Verdict: ACCEPTED

Test 65

Verdict: ACCEPTED

Test 66

Verdict: ACCEPTED

Test 67

Verdict: ACCEPTED

Test 68

Verdict: ACCEPTED

Test 69

Verdict: ACCEPTED

Test 70

Verdict: ACCEPTED

Test 71

Verdict: ACCEPTED

Test 72

Verdict: ACCEPTED

Test 73

Verdict: ACCEPTED

Test 74

Verdict: ACCEPTED

Test 75

Verdict: ACCEPTED

Test 76

Verdict: ACCEPTED

Test 77

Verdict: ACCEPTED

Test 78

Verdict: ACCEPTED

Test 79

Verdict: ACCEPTED

Test 80

Verdict: ACCEPTED

Test 81

Verdict: ACCEPTED

Test 82

Verdict: ACCEPTED

Test 83

Verdict: ACCEPTED

Test 84

Verdict: ACCEPTED

Test 85

Verdict: ACCEPTED

Test 86

Verdict: ACCEPTED

Test 87

Verdict: ACCEPTED

Test 88

Verdict: ACCEPTED

Test 89

Verdict: ACCEPTED

Test 90

Verdict: ACCEPTED

Test 91

Verdict: ACCEPTED

Test 92

Verdict: ACCEPTED

Test 93

Verdict: ACCEPTED

Test 94

Verdict: ACCEPTED

Test 95

Verdict: ACCEPTED

Test 96

Verdict: ACCEPTED

Test 97

Verdict: ACCEPTED

Test 98

Verdict: ACCEPTED

Test 99

Verdict: ACCEPTED

Test 100

Verdict: ACCEPTED