QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#692055	#6443. Windblume Festival	zth^#	WA	96ms	3652kb	C++23	624b	2024-10-31 13:42:51	2024-10-31 13:42:52

Judging History

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

[2024-10-31 13:42:52]
评测

测评结果：WA
用时：96ms
内存：3652kb

查看

[2024-10-31 13:42:51]
提交

answer

#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 1e6 + 5;
int n, a[N];

void solve()
{
    cin >> n;
    for(int i = 1;i <= n;++i) cin >> a[i];
    int sum = 0;
    for(int i = 1;i <= n;++i) sum += abs(a[i]);
    int ans = -1e9;
    for(int i = 1;i <= n;++i)
    {
        int l = i, r = i % n + 1;
        int tmp = sum - abs(a[l]) - abs(a[r]);
        tmp += a[l] - a[r];
        ans = max(ans, tmp);
    }
    cout << ans << '\n';
}

signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    cin >> t;
    while(t--) solve();
    return 0;
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3644kb

input:

5
4
1 -3 2 -4
11
91 66 73 71 32 83 72 79 84 33 93
12
91 66 73 71 32 83 72 79 84 33 33 93
13
91 66 73 71 32 83 72 79 84 33 33 33 93
1
0

output:

result:

ok 5 number(s): "10 713 746 779 0"

Test #2:

score: -100

Wrong Answer

time: 96ms

memory: 3652kb

input:

output:

-2
-2
-1
-1
-2
-1
-2
-2
-2
-2
-1
-1
-2
-2
-2
-2
-2
0
-2
-1
-1
0
-2
0
-1
-1
-2
-2
-2
-1
-2
-1
-1
0
-2
0
-1
-1
-2
-2
0
-2
0
-1
-1
-2
0
-2
-2
0
-1
-1
-2
-1
0
-1
-1
-1
-1
-1
-2
0
0
-2
-2
-2
-1
-2
-2
-1
-2
-1
-2
-2
-1
-1
0
-2
0
0
0
-1
-1
-2
-1
-1
0
-2
-1
-2
-1
-1
0
-1
-2
-2
-1
-1
0
-2
-2
-2
-1
0
-1
0
-1
...

result:

wrong answer 1st numbers differ - expected: '2', found: '-2'