Submission #523311

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
523311	2022-02-07T12:01:02 Z	lucri	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++17	100 / 100	82 ms	6980 KB

Main

#include <iostream>
using namespace std;
long long n,a[200010],st[200010],dr[200010],ans=100000000000000000;
int main()
{
    cin>>n;
    for(int i=1;i<=n;++i)
    {
        cin>>a[i];
        st[i]=st[i-1];
        if(a[i-1]>=a[i])
            st[i]+=a[i-1]-a[i]+1;
    }
    for(int i=n;i>=1;--i)
    {
        dr[i]=dr[i+1];
        if(a[i+1]>=a[i])
            dr[i]+=a[i+1]-a[i]+1;
    }
    for(int i=1;i<=n;++i)
        ans=min(ans,max(st[i],dr[i]));
    cout<<ans;
    return 0;
}

Subtask #1

40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	280 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	304 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	2 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	288 KB	Output is correct
13	Correct	1 ms	308 KB	Output is correct
14	Correct	1 ms	328 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	324 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	324 KB	Output is correct
22	Correct	1 ms	324 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct

Subtask #2

60.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	280 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	304 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	2 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	288 KB	Output is correct
13	Correct	1 ms	308 KB	Output is correct
14	Correct	1 ms	328 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	324 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	324 KB	Output is correct
22	Correct	1 ms	324 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	76 ms	6964 KB	Output is correct
27	Correct	79 ms	6860 KB	Output is correct
28	Correct	76 ms	6872 KB	Output is correct
29	Correct	74 ms	6856 KB	Output is correct
30	Correct	62 ms	6152 KB	Output is correct
31	Correct	75 ms	6868 KB	Output is correct
32	Correct	73 ms	6820 KB	Output is correct
33	Correct	74 ms	6808 KB	Output is correct
34	Correct	73 ms	6924 KB	Output is correct
35	Correct	51 ms	6088 KB	Output is correct
36	Correct	58 ms	6236 KB	Output is correct
37	Correct	53 ms	6192 KB	Output is correct
38	Correct	74 ms	6800 KB	Output is correct
39	Correct	80 ms	6980 KB	Output is correct
40	Correct	73 ms	6844 KB	Output is correct
41	Correct	74 ms	6868 KB	Output is correct
42	Correct	67 ms	6640 KB	Output is correct
43	Correct	82 ms	6832 KB	Output is correct
44	Correct	72 ms	6832 KB	Output is correct
45	Correct	78 ms	6868 KB	Output is correct
46	Correct	77 ms	6844 KB	Output is correct
47	Correct	73 ms	6852 KB	Output is correct
48	Correct	73 ms	6880 KB	Output is correct