oj.uz

Submission #442652

# Submission time Handle Problem Language Result Execution time Memory
442652 2021-07-08T12:43:57 Z zaneyu Growing Vegetables is Fun 4 (JOI21_ho_t1) C++14
100 / 100
 35 ms 6332 KB 
/*input
8
12 2 34 85 4 91 29 85
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=1e18+1;
const int INF=0x3f3f3f3f;
const int MOD=1e9+9;
const ld PI=acos(-1);
const ld eps=1e-3;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
inline ll mult(ll a,ll b){
    if(a>=MOD) a%=MOD;
    if(b>=MOD) b%=MOD;
    return (a*b)%MOD;
}
inline ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
const int maxn=2e5+5;
const int maxlg=__lg(maxn)+2;
ll pref[maxn],suff[maxn];
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n;
    cin>>n;
    int pv;
    cin>>pv;
    vector<int> v;
    REP(i,n-1){
        int x;
        cin>>x;
        v.pb(x-pv);
        pv=x;
    } 
    REP1(i,n-1) pref[i]=pref[i-1]+max(-v[i-1]+1,0);
    for(int i=n-1;i>=1;i--) suff[i]=suff[i+1]+max(v[i-1]+1,0);
    ll ans=INF64;
    REP(i,n){
        MNTO(ans,max(pref[i],suff[i+1]));
    }
    cout<<ans<<'\n';
}

Subtask #1
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 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 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 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 332 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 332 KB Output is correct
22 Correct 1 ms 332 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 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 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 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 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 332 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 332 KB Output is correct
22 Correct 1 ms 332 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 29 ms 6248 KB Output is correct
27 Correct 31 ms 6208 KB Output is correct
28 Correct 33 ms 6300 KB Output is correct
29 Correct 30 ms 6252 KB Output is correct
30 Correct 27 ms 5564 KB Output is correct
31 Correct 29 ms 6332 KB Output is correct
32 Correct 31 ms 6208 KB Output is correct
33 Correct 29 ms 6228 KB Output is correct
34 Correct 29 ms 6208 KB Output is correct
35 Correct 28 ms 5436 KB Output is correct
36 Correct 24 ms 5532 KB Output is correct
37 Correct 24 ms 5676 KB Output is correct
38 Correct 30 ms 6284 KB Output is correct
39 Correct 32 ms 6300 KB Output is correct
40 Correct 30 ms 6304 KB Output is correct
41 Correct 29 ms 6216 KB Output is correct
42 Correct 27 ms 6024 KB Output is correct
43 Correct 28 ms 6308 KB Output is correct
44 Correct 29 ms 6176 KB Output is correct
45 Correct 29 ms 6248 KB Output is correct
46 Correct 28 ms 6212 KB Output is correct
47 Correct 29 ms 6204 KB Output is correct
48 Correct 35 ms 6252 KB Output is correct