Practical2/checkout.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68

#include <stdio.h>
#include <stdint.h>

#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wreturn-type"
int8_t round_profit(uint32_t value) {
    switch (value % 5) {
        case 0: return 0;
        case 1: return 1;
        case 2: return 2;
        case 3: return -2;
        case 4: return -1;
    }
}
#pragma GCC diagnostic pop

int32_t maximum_profit(int seq[], uint16_t seq_len, uint8_t k) {
    int8_t gain[seq_len+1][k+1];
    uint16_t p, d, i;
    for (p = 0; p <= seq_len; p++) {
        uint32_t sum[p];
        if (p == 0) {
            sum[0] = 0;
        } else {
            sum[p-1] = seq[p-1];
            for (i = p-2; i != UINT16_MAX; i--)
                sum[i] = seq[i] + sum[i+1];
        }

        for (d = 0; d <= k; d++) {
            if (p == 0) {
                gain[p][d] = 0;
            } else if (d == 0) {
                gain[p][d] = round_profit(sum[0]);
            } else {
                int8_t max = gain[p][d-1];
                for (i = 0; i < p; i++) {
                    int8_t try = gain[i][d-1] + round_profit(sum[i]);
                    if (try > max)
                        max = try;
                }
                gain[p][d] = max;
            }
        }
    }

    return gain[seq_len][k];
}

int main(void) {
    int seq_len, k;
    uint32_t sum = 0;
    scanf("%d %d", &seq_len, &k);
    int seq[seq_len];

    uint16_t i;
    for (i = 0; i < seq_len; i++) {
        scanf("%d", &(seq[i]));
        sum += seq[i];
        if (seq[i] % 5 == 0) {
            seq_len--;
            i--;
        }
    }

    printf("%d\n", sum - maximum_profit(seq, seq_len, k));
}