QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #369483 | #6751. Game | xjx | WA | 36ms | 6040kb | C++11 | 420b | 2024-03-28 11:37:33 | 2024-03-28 11:37:33 |
Judging History
answer
#include<iostream>
using namespace std;
int a[200005];
long long dp[200005];
int main(){
int n,s=0;
cin>> n;
for (int i = 0;i < n;i++)cin >> a[i];
for (int i = 0;i < n;i++) {
s = max(min(min(a[i], a[(i + n - 1) % n]), a[(i + 1) % n]), s);
if (i == 0 || i == 1)dp[i] = s;
else if (i == 2)dp[i] = s + dp[0];
else dp[i] = max(dp[i - 2], dp[i - 3]) + s;
}
cout << max(dp[n-1],dp[n-2]) << endl;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3600kb
input:
2 7 5
output:
5
result:
ok 1 number(s): "5"
Test #2:
score: -100
Wrong Answer
time: 36ms
memory: 6040kb
input:
200000 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 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 1...
output:
9999999999
result:
wrong answer 1st numbers differ - expected: '10000050000', found: '9999999999'