代码

// This code is AI-generated. (AI 生成的代码)
// NOIP2018 铺设道路: answer = sum_i max(0, d_i - d_{i-1}) (d_0 = 0).
typedef unsigned long long u64;
struct DuckInfo {
    u64 abi;
    const char *in; u64 in_size;
    char *out; u64 out_limit; u64 out_size;
    char *err; u64 err_limit; u64 err_size;
    const char *ib; u64 ib_limit;
    char *ob; u64 ob_limit; u64 tsc;
} __attribute__((packed));

static const char *g_in;

static u64 rd(void) {
    while (*g_in && (unsigned char)*g_in <= ' ') g_in++;
    u64 v = 0;
    while ((unsigned char)*g_in > ' ') v = v * 10 + (u64)(*g_in++ - '0');
    return v;
}

int main(void) { return 0; }

void __libc_start_main(int (*mf)(int, char **, char **), int ac, char **av) {
    (void)mf;
    char **e = av + ac + 1;
    while (*e) e++;
    u64 *aux = (u64 *)(e + 1);
    struct DuckInfo *d = 0;
    for (; aux[0]; aux += 2)
        if (aux[0] == 0x6b637564) { d = (struct DuckInfo *)aux[1]; break; }
    g_in = d->in;
    u64 n = rd(), prev = 0, sum = 0;
    for (u64 i = 0; i < n; i++) {
        u64 x = rd();
        if (x > prev) sum += x - prev;
        prev = x;
    }
    char tmp[24];
    int k = 0;
    if (!sum) tmp[k++] = '0';
    while (sum) { tmp[k++] = (char)('0' + sum % 10); sum /= 10; }
    char *o = d->out;
    while (k) *o++ = tmp[--k];
    *o++ = '\n';
    d->out_size = (u64)(o - d->out);
    __asm__ volatile("mov $60,%%eax; xor %%edi,%%edi; syscall" ::: "rax","rdi","rcx","r11","memory");
    __builtin_unreachable();
}

评测结果