제출 #573601

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
573601		MohammadAghil	Bigger segments (IZhO19_segments)	C++14	100 / 100	80 ms	13072 KiB

segments

      #include <bits/stdc++.h>
//   #pragma GCC optimize ("Ofast,unroll-loops")
// #pragma GCC target ("avx2")
    using namespace std;
  typedef long long ll;
   typedef pair<int, int> pp;
    #define er(args ...) cerr << __LINE__ << ": ", err(new istringstream(string(#args)), args), cerr << endl
      #define per(i,r,l) for(int i = (r); i >= (l); i--)
        #define rep(i,l,r) for(int i = (l); i < (r); i++)
           #define all(x) x.begin(), x.end()
              #define sz(x) (int)(x).size()
                  #define pb push_back
                      #define ss second
                           #define ff first
                                   void err(istringstream *iss){}template<typename T,typename ...Args> void err(istringstream *iss,const T &_val, const Args&...args){string _name;*iss>>_name;if(_name.back()==',')_name.pop_back();cerr<<_name<<" = "<<_val<<", ",err(iss,args...);}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll mod = 1e9 + 7, maxn = 1e6 + 5, lg = 22, lng = 26, inf = ll(1e9) + 5;
ll pw(ll a,ll b,ll md=mod){if(!b)return 1;ll k=pw(a,b>>1ll);return k*k%md*(b&1ll?a:1)%md;}

int dp[maxn], st[maxn];

int main(){
     cin.tie(0) -> sync_with_stdio(0);
     ll n; cin >> n;
     vector<ll> a(n+1);
     rep(i,1,n+1) cin >> a[i], a[i] += a[i-1];
     rep(i,1,n+1){
          st[i] = max(st[i], st[i-1]);
          dp[i] = dp[st[i]] + 1;
          ll vl = (a[i]<<1) - a[st[i]];
          int pos = lower_bound(all(a), vl) - begin(a);
          st[pos] = i;
     }
     cout << dp[n] << '\n';
     return 0; 
}

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