Wheel of fortune

input/code.cpp: In function 'void Test()':
input/code.cpp:12:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     freopen("temp\\in.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
input/code.cpp:20:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         scanf("%d", &a[i]);
      |         ~~~~~^~~~~~~~~~~~~

#include<iostream>
#include<cstdio>
#include<algorithm>
typedef long long LL;
using std::max;
const int N=1e5+3, INF = 0x3f3f3f3f;

int a[N], f[N][10];

void Test()
{
    freopen("temp\\in.txt", "r", stdin);
}
int main()
{
    // Test();
    int n;
    scanf("%d", &n);
    for(int i=1; i<=n; i++)
        scanf("%d", &a[i]);

    f[1][1] = a[1];
    f[1][5] = -a[1];

    f[2][1] = -INF;
    f[2][2] = f[1][1] - a[2];
    f[2][3] = f[1][1];
    f[2][3+1] = f[1][5] + a[2];
    f[2][3+2] = -INF;
    f[2][3+3] = f[1][5];
    f[2][6+1] = f[1][9] + a[2];
    f[2][6+2] = f[1][9] - a[2];
    f[2][6+3] = -INF;

    for(int i=3; i<n; i++)
    {
        for(int j=0; j<=6; j+=3)
        {
            // choose
            f[i][j+1] = max(f[i-1][j+2], f[i-1][j+3]);
            f[i][j+1] += a[i];
            // unchoose
            f[i][j+2] = max(f[i-1][j+1], f[i-1][j+3]);
            f[i][j+2] -= a[i];
            // ignore
            f[i][j+3] = max(f[i-1][j+1], f[i-1][j+2]);
        }
    }

    f[n][1] = -INF;
    f[n][2] = f[n-1][3] - a[n];
    f[n][3] = f[n-1][2];
    f[n][3+1] = f[n-1][3+3] + a[n];
    f[n][3+2] = -INF;
    f[n][3+3] = f[n-1][3+1];
    f[n][6+1] = f[n-1][6+2] + a[n];
    f[n][6+2] = f[n-1][6+1] - a[n];
    f[n][6+3] = -INF;

    int ans = -INF;
    for(int i=1; i<=9; i++)
        ans = max(ans, f[n][i]);

// for(int i=1; i<=n; i++)
// {
//     for(int j=1; j<=9; j++)
//         printf("%d ", f[i][j]);
//     putchar('\n');
// }

    printf("%d", ans);
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: ACCEPTED

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: ACCEPTED

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: ACCEPTED

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: ACCEPTED

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: WRONG ANSWER

Test 25

Verdict: WRONG ANSWER

Test 26

Verdict: WRONG ANSWER

Test 27

Verdict: WRONG ANSWER

Test 28

Verdict: WRONG ANSWER

Test 29

Verdict: ACCEPTED

Test 30

Verdict: WRONG ANSWER

Test 31

Verdict: ACCEPTED

Test 32

Verdict: WRONG ANSWER

Test 33

Verdict: WRONG ANSWER

Test 34

Verdict: WRONG ANSWER

Test 35

Verdict: WRONG ANSWER

Test 36

Verdict: WRONG ANSWER

Test 37

Verdict: WRONG ANSWER

Test 38

Verdict: ACCEPTED

Test 39

Verdict: WRONG ANSWER

Test 40

Verdict: ACCEPTED

Test 41

Verdict: WRONG ANSWER

Test 42

Verdict: ACCEPTED

Test 43

Verdict: WRONG ANSWER

Test 44

Verdict: ACCEPTED

Test 45

Verdict: WRONG ANSWER

Test 46

Verdict: WRONG ANSWER

Test 47

Verdict: WRONG ANSWER

Test 48

Verdict: WRONG ANSWER

Test 49

Verdict: WRONG ANSWER

Test 50

Verdict: ACCEPTED

Test 51

Verdict: WRONG ANSWER

Test 52

Verdict: ACCEPTED

Test 53

Verdict: WRONG ANSWER

Test 54

Verdict: ACCEPTED

Test 55

Verdict: WRONG ANSWER

Test 56

Verdict: ACCEPTED

Test 57

Verdict: WRONG ANSWER

Test 58

Verdict: WRONG ANSWER

Test 59

Verdict: WRONG ANSWER

Test 60

Verdict: WRONG ANSWER

Test 61

Verdict: WRONG ANSWER

Test 62

Verdict: ACCEPTED

Test 63

Verdict: WRONG ANSWER

Test 64

Verdict: WRONG ANSWER

Test 65

Verdict: WRONG ANSWER

Test 66

Verdict: ACCEPTED

Test 67

Verdict: WRONG ANSWER

Test 68

Verdict: ACCEPTED

Test 69

Verdict: WRONG ANSWER

Test 70

Verdict: ACCEPTED

Test 71

Verdict: WRONG ANSWER

Test 72

Verdict: WRONG ANSWER

Test 73

Verdict: WRONG ANSWER

Test 74

Verdict: WRONG ANSWER

Test 75

Verdict: WRONG ANSWER

Test 76

Verdict: WRONG ANSWER

Test 77

Verdict: WRONG ANSWER

Test 78

Verdict: ACCEPTED

Test 79

Verdict: WRONG ANSWER

Test 80

Verdict: ACCEPTED

Test 81

Verdict: WRONG ANSWER

Test 82

Verdict: WRONG ANSWER

Test 83

Verdict: WRONG ANSWER

Test 84

Verdict: WRONG ANSWER

Test 85

Verdict: WRONG ANSWER

Test 86

Verdict: WRONG ANSWER

Test 87

Verdict: WRONG ANSWER

Test 88

Verdict: WRONG ANSWER

Test 89

Verdict: WRONG ANSWER

Test 90

Verdict: WRONG ANSWER

Test 91

Verdict: ACCEPTED

Test 92

Verdict: WRONG ANSWER

Test 93

Verdict: ACCEPTED

Test 94

Verdict: WRONG ANSWER

Test 95

Verdict: WRONG ANSWER

Test 96

Verdict: WRONG ANSWER

Test 97

Verdict: WRONG ANSWER

Test 98

Verdict: WRONG ANSWER

Test 99

Verdict: WRONG ANSWER

Test 100

Verdict: ACCEPTED