QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #671982 | #5035. foo~ | DaiRuiChen007 | 0 | 6ms | 10428kb | C++17 | 786b | 2024-10-24 15:13:07 | 2024-10-24 15:13:07 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int MAXN=6e5+5,inf=1e9;
int n,k,a[MAXN],ans=0,f[MAXN],g[MAXN];
int w(int l,int r) {
int z=0,s=0,t=0;
for(int i=l;i<=r;++i) if(a[i]>z) z=a[i],++s;
z=0;
for(int i=r;i>=l;--i) if(a[i]>z) z=a[i],++t;
return max(s,t);
}
void DP() {
memset(f,-0x3f,sizeof(f)),f[0]=0;
for(int x=1;x<=k;++x) {
memset(g,-0x3f,sizeof(g));
for(int i=1;i<=n;++i) {
for(int j=0;j<i;++j) {
g[i]=max(g[i],f[j]+w(j+1,i));
}
}
memcpy(f,g,sizeof(f));
}
ans=max(ans,*max_element(f+1,f+n+1));
}
signed main() {
scanf("%d%d",&n,&k);
for(int i=1;i<=n;++i) scanf("%d",&a[i]);
int t=find(a+1,a+n+1,n)-a;
assert(a[t]==n);
rotate(a+1,a+t,a+n+1),DP();
rotate(a+1,a+2,a+n+1),DP();
printf("%d\n",ans);
return 0;
}
詳細信息
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 10
Accepted
time: 5ms
memory: 8964kb
input:
23 6 16 20 22 4 21 10 3 7 5 8 15 12 9 1 6 17 23 13 11 19 18 14 2
output:
20
result:
ok "20"
Test #2:
score: 10
Accepted
time: 0ms
memory: 9336kb
input:
13 6 13 9 3 4 12 6 5 1 8 10 11 7 2
output:
13
result:
ok "13"
Test #3:
score: 10
Accepted
time: 0ms
memory: 9444kb
input:
25 3 25 2 3 19 5 6 7 11 8 10 9 20 4 14 21 1 17 12 13 18 15 22 23 16 24
output:
16
result:
ok "16"
Test #4:
score: 10
Accepted
time: 6ms
memory: 10296kb
input:
25 9 1 11 10 23 9 24 7 8 19 3 5 21 18 12 15 16 17 13 2 20 14 22 4 6 25
output:
23
result:
ok "23"
Test #5:
score: 10
Accepted
time: 3ms
memory: 10024kb
input:
13 2 1 4 2 3 5 6 7 8 9 10 12 11 13
output:
12
result:
ok "12"
Test #6:
score: 10
Accepted
time: 4ms
memory: 9312kb
input:
17 5 4 2 3 6 5 1 7 8 13 16 11 12 9 14 15 10 17
output:
15
result:
ok "15"
Test #7:
score: 10
Accepted
time: 2ms
memory: 8724kb
input:
8 2 1 2 5 6 3 4 7 8
output:
8
result:
ok "8"
Test #8:
score: 10
Accepted
time: 4ms
memory: 9204kb
input:
11 5 3 11 2 10 6 5 1 4 8 7 9
output:
11
result:
ok "11"
Test #9:
score: 10
Accepted
time: 0ms
memory: 10324kb
input:
10 1 5 3 4 1 10 8 9 6 7 2
output:
6
result:
ok "6"
Test #10:
score: 0
Wrong Answer
time: 3ms
memory: 10428kb
input:
16 2 15 12 14 9 11 13 1 3 10 8 5 2 16 4 6 7
output:
10
result:
wrong answer 1st words differ - expected: '9', found: '10'
Subtask #2:
score: 0
Time Limit Exceeded
Test #21:
score: 0
Time Limit Exceeded
input:
93943 1 87243 48984 50611 19218 77699 25025 85769 28141 13380 34875 42459 66419 53472 4367 48292 16894 92171 87263 42527 67085 30687 29235 27515 81053 31421 34864 83591 70491 75344 7026 50250 63402 26773 5330 36308 76399 80032 15501 16205 71750 73964 67876 68901 70548 2043 79979 89479 19784 38838 44...
output:
result:
Subtask #3:
score: 0
Time Limit Exceeded
Test #36:
score: 0
Time Limit Exceeded
input:
1992 25 144 612 1315 1966 1779 1773 1529 625 36 1849 1783 1441 1388 1558 1258 724 137 397 542 353 1162 1213 406 792 1317 882 994 298 1864 1969 103 449 508 1501 89 1721 195 778 657 222 1152 1780 613 743 1206 694 829 142 69 1973 1465 1343 655 1540 155 146 350 491 759 1695 1082 1357 1329 1745 232 1850 ...
output:
result:
Subtask #4:
score: 0
Skipped
Dependency #1:
0%
Subtask #5:
score: 0
Skipped
Dependency #4:
0%
Subtask #6:
score: 0
Skipped
Dependency #2:
0%