QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #215855 | #6443. Windblume Festival | veg# | WA | 143ms | 3848kb | C++14 | 455b | 2023-10-15 14:01:55 | 2023-10-15 14:01:55 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6+5;
int a[N];
int main() {
int T; scanf("%d",&T);
while(T--) {
int n; scanf("%d",&n); ll ans=0;
for(int i=1;i<=n;++i) scanf("%d",&a[i]),ans+=abs(a[i]);
if(n==1)
{
printf("%lld\n",a[1]);
continue;
}
ll s=-1e18;
for(int i=1;i<=n;++i) {
int j=i%n+1;
s=max(s,ans-abs(a[i])-abs(a[j])+a[i]-a[j]);
}
printf("%lld\n",s);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3676kb
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:
10 713 746 779 0
result:
ok 5 number(s): "10 713 746 779 0"
Test #2:
score: -100
Wrong Answer
time: 143ms
memory: 3848kb
input:
1000000 1 2 1 -2 1 1 1 -1 1 2 1 1 1 2 1 -2 1 -2 1 2 1 1 1 1 1 2 1 2 1 2 1 -2 1 -2 1 0 1 2 1 1 1 -1 1 0 1 -2 1 0 1 1 1 1 1 -2 1 -2 1 2 1 1 1 2 1 1 1 1 1 0 1 2 1 0 1 -1 1 -1 1 -2 1 -2 1 0 1 -2 1 0 1 1 1 -1 1 2 1 0 1 -2 1 -2 1 0 1 1 1 -1 1 -2 1 -1 1 0 1 -1 1 -1 1 -1 1 -1 1 1 1 2 1 0 1 0 1 -2 1 2 1 2 1 ...
output:
2 4294967294 1 4294967295 2 1 2 4294967294 4294967294 2 1 1 2 2 2 4294967294 4294967294 0 2 1 4294967295 0 4294967294 0 1 1 4294967294 4294967294 2 1 2 1 1 0 2 0 4294967295 4294967295 4294967294 4294967294 0 4294967294 0 1 4294967295 2 0 4294967294 4294967294 0 1 4294967295 4294967294 4294967295 0 4...
result:
wrong answer 2nd numbers differ - expected: '-2', found: '4294967294'