QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #811812 | #2175. Growing Vegetables is Fun 4 | sichengzhou# | 0 | 1ms | 5824kb | C++17 | 595b | 2024-12-13 01:52:47 | 2024-12-13 01:52:48 |
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=2e5+5;
int n;
LL a[N],s[N],t[N],f[N],g[N],b[N];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=1;i<=n;i++)
{
f[i]=max(f[i-1]+1,a[i]);
s[i]=s[i-1]+f[i]-a[i];
}
for(int i=n;i>=1;i--)
{
g[i]=max(g[i+1]+1,a[i]);
t[i]=t[i+1]+g[i]-a[i];
}
LL ans=2e18;
for(int i=1;i<=n;i++)
{
ans=min(ans,max(s[i-1],t[i+1])+max(f[i],g[i])-a[i]);
}
cout<<ans<<'\n';
return 0;
}
详细
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 40
Accepted
time: 1ms
memory: 5692kb
input:
2 569756508 265577686
output:
0
result:
ok single line: '0'
Test #2:
score: 40
Accepted
time: 1ms
memory: 5616kb
input:
2 905574077 905574077
output:
1
result:
ok single line: '1'
Test #3:
score: 40
Accepted
time: 0ms
memory: 3652kb
input:
3 970577574 477262134 791905208
output:
314643075
result:
ok single line: '314643075'
Test #4:
score: 40
Accepted
time: 0ms
memory: 3648kb
input:
3 634647532 634647532 634647532
output:
1
result:
ok single line: '1'
Test #5:
score: 0
Wrong Answer
time: 1ms
memory: 5824kb
input:
1999 835109617 608292283 618117484 497958957 611607015 70168164 477454019 70333286 821931315 104232697 234095331 41806748 813743448 676090182 776662569 441747966 907663428 993530698 7954955 202095258 789793212 448943101 515564795 68382202 507155724 819747128 339256745 491780118 461177551 81438287 48...
output:
498940438714
result:
wrong answer 1st lines differ - expected: '166120578451', found: '498940438714'
Subtask #2:
score: 0
Skipped
Dependency #1:
0%