제출 #376254

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
376254		zaneyu	Bigger segments (IZhO19_segments)	C++14	13 / 100	1588 ms	123548 KiB

segments

/*input
3
3 1 2
*/
#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<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("O2","unroll-loops","no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<ll,ll>;
#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=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#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<0) a+=MOD;
    if(b<0) b+=MOD;
    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=3e4+5;
const int maxlg=__lg(maxn)+2;
int arr[maxn];
map<pii,vector<pii>> v;
map<pii,int> dp;
map<pii,bool> vis;
int n;
void rec(int i,ll sum){
    if(vis[{i,sum}]) return;
    if(i==n-1) return;
    vis[{i,sum}]=1;
    ll tot=0;
    for(int j=i+1;j<n;j++){
        tot+=arr[j];
        if(tot>=sum){
            rec(j,tot);
            v[{j,tot}].pb({i,sum});
        }
    }
}
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    cin>>n;
    REP(i,n) cin>>arr[i];
    rec(-1,0);
    int mx=0;
    for(auto x:v){
        for(auto z:x.s){
            //cout<<x.f.f<<' '<<x.f.s<<' '<<z.f<<' '<<z.s<<'\n';
            MXTO(dp[x.f],dp[z]+1);
        }
        if(x.f.f==n-1) MXTO(mx,dp[x.f]);
    }
    cout<<mx;
}

• Subtask 1: 13 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27