QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#168342#7067. The Great Wallsupepapupu#WA 1ms3688kbC++171.1kb2023-09-08 10:19:412023-09-08 10:19:42

Judging History

你现在查看的是最新测评结果

  • [2023-09-08 10:19:42]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3688kb
  • [2023-09-08 10:19:41]
  • 提交

answer

#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 1e4 + 10, INF = 0x3f3f3f3f, mod = 998244353;

inline int read() {
    int f = 1, k = 0;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') f = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        k = k * 10 + c - '0';
        c = getchar();
    }
    return f * k;
}

int n;
int a[N], f[N], dp[N];

int main() {
    // ios::sync_with_stdio(0); cin.tie(0);
    n = read();
    for (int i = 1; i <= n; ++i) a[i] = read();
    for (int k = 1; k <= n; ++k) {
        int g = dp[k - 1] - a[k];
        int h = dp[k - 1] + a[k];
        for (int i = 1; i <= k; ++i) f[i] = 0;
        for (int i = k + 1; i <= n; ++i) {
            f[i] = max(f[i - 1], max(g + a[i], h - a[i]));
            g = max(g, dp[i - 1] - a[i]);
            h = max(h, dp[i - 1] + a[i]);
            // cout << f[i] << " \n"[i == n];
        }
        printf("%d\n", f[n]);
        swap(f, dp);
    }
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3652kb

input:

5
1 2 3 4 5

output:

4
3
2
1
0

result:

ok 5 lines

Test #2:

score: 0
Accepted
time: 1ms
memory: 3648kb

input:

5
1 2 1 2 1

output:

1
2
2
1
0

result:

ok 5 lines

Test #3:

score: -100
Wrong Answer
time: 1ms
memory: 3688kb

input:

6
1 1 4 5 1 4

output:

4
7
7
4
3
0

result:

wrong answer 4th lines differ - expected: '7', found: '4'