Wheel of fortune

input/code.cpp: In function 'int main()':
input/code.cpp:56:9: warning: unused variable 'b' [-Wunused-variable]
   56 |     int b = count_array[n-1][0];
      |         ^
input/code.cpp:57:9: warning: unused variable 'r' [-Wunused-variable]
   57 |     int r = count_array[n-1][1];
      |         ^
input/code.cpp:58:9: warning: unused variable 'g' [-Wunused-variable]
   58 |     int g = count_array[n-1][2];
      |         ^
input/code.cpp:63:9: warning: variable 'color' set but not used [-Wunused-but-set-variable]
   63 |     int color = true;
      |         ^~~~~

#include <bits/stdc++.h>

using namespace std;
#define int long long

// g++ <filename>.cpp -g -Wall -Wextra -DDEBUG -o <executable>

// copied from: https://codeforces.com/blog/entry/79024
// === Debug macro starts here ===

int recur_depth = 0;
#ifdef DEBUG
#define dbg(x) {++recur_depth; auto x_=x; --recur_depth; cerr<<string(recur_depth, '\t')<<"\e[91m"<<__func__<<":"<<__LINE__<<"\t"<<#x<<" = "<<x_<<"\e[39m"<<endl;}
#else
#define dbg(x)
#endif
template<typename Ostream, typename Cont>
typename enable_if<is_same<Ostream,ostream>::value, Ostream&>::type operator<<(Ostream& os,  const Cont& v){
	os<<"[";
	for(auto& x:v){os<<x<<", ";}
	return os<<"]";
}
template<typename Ostream, typename ...Ts>
Ostream& operator<<(Ostream& os,  const pair<Ts...>& p){
	return os<<"{"<<p.first<<", "<<p.second<<"}";
}

// === Debug macro ends here ===

signed main() {
    
    int n;
    cin >> n;
    
    vector<int> monies;
    // 0 = black, 1 = red, 2 = green
    int count_array[n][3];

    for (int i = 0; i < n; i++) {
        int p;
        cin >> p;
        monies.push_back(p);
    }

    count_array[0][0] = monies[0];
    count_array[0][1] = -monies[0];
    count_array[0][2] = 0;


    for (int i = 1; i < n; i++) {
        count_array[i][0] = max(monies[i] + count_array[i-1][1], monies[i] + count_array[i-1][2]);
        count_array[i][1] = max(-monies[i] + count_array[i-1][0], -monies[i] + count_array[i-1][2]);
        count_array[i][2] = max(count_array[i-1][0], count_array[i-1][1]);
    }

    int b = count_array[n-1][0];
    int r = count_array[n-1][1];
    int g = count_array[n-1][2];

    int first = monies[0];
    int second = monies[1];

    int color = true;
    if (first < second) {
        color = false;
    }

    int maximum = max(max(count_array[n-1][0], count_array[n-1][1]), count_array[n-1][2]);

    // cout << count_array[n-1][0] << " " << count_array[n-1][1] << " " << count_array[n-1][2];
    cout << maximum;



    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

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

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

Test 16

Verdict: ACCEPTED

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: ACCEPTED

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: ACCEPTED

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: ACCEPTED

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: WRONG ANSWER

Test 27

Verdict: WRONG ANSWER

Test 28

Verdict: WRONG ANSWER

Test 29

Verdict: WRONG ANSWER

Test 30

Verdict: WRONG ANSWER

Test 31

Verdict: WRONG ANSWER

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: WRONG ANSWER

Test 36

Verdict: WRONG ANSWER

Test 37

Verdict: WRONG ANSWER

Test 38

Verdict: WRONG ANSWER

Test 39

Verdict: ACCEPTED

Test 40

Verdict: WRONG ANSWER

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: WRONG ANSWER

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: WRONG ANSWER

Test 50

Verdict: WRONG ANSWER

Test 51

Verdict: ACCEPTED

Test 52

Verdict: WRONG ANSWER

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: WRONG ANSWER

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: WRONG ANSWER

Test 62

Verdict: WRONG ANSWER

Test 63

Verdict: ACCEPTED

Test 64

Verdict: WRONG ANSWER

Test 65

Verdict: ACCEPTED

Test 66

Verdict: WRONG ANSWER

Test 67

Verdict: ACCEPTED

Test 68

Verdict: WRONG ANSWER

Test 69

Verdict: ACCEPTED

Test 70

Verdict: WRONG ANSWER

Test 71

Verdict: ACCEPTED

Test 72

Verdict: WRONG ANSWER

Test 73

Verdict: ACCEPTED

Test 74

Verdict: ACCEPTED

Test 75

Verdict: WRONG ANSWER

Test 76

Verdict: WRONG ANSWER

Test 77

Verdict: WRONG ANSWER

Test 78

Verdict: WRONG ANSWER

Test 79

Verdict: WRONG ANSWER

Test 80

Verdict: WRONG ANSWER

Test 81

Verdict: ACCEPTED

Test 82

Verdict: ACCEPTED

Test 83

Verdict: ACCEPTED

Test 84

Verdict: WRONG ANSWER

Test 85

Verdict: WRONG ANSWER

Test 86

Verdict: WRONG ANSWER

Test 87

Verdict: ACCEPTED

Test 88

Verdict: WRONG ANSWER

Test 89

Verdict: ACCEPTED

Test 90

Verdict: ACCEPTED

Test 91

Verdict: WRONG ANSWER

Test 92

Verdict: ACCEPTED

Test 93

Verdict: WRONG ANSWER

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