제출 #337250

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

segments

#include <bits/stdc++.h>

using namespace std;

#define ff first
#define ss second
#define MAXN 500001

int a[MAXN], dp[MAXN];
int prefsum[MAXN];

int main(){
   ios_base::sync_with_stdio(0);
   cin.tie(0);
   
   int n;
   cin >> n;
   
   for (int i = 1; i <= n; i++) {
      cin >> a[i];
      prefsum[i] = prefsum[i - 1] + a[i];
   }
   
   priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
   
   q.push({0,0});
   int tmp=0;
   for(int i = 1; i <= n; i++){
      while (!q.empty() && q.top().ff <= prefsum[i]) {
         if (dp[q.top().ss] > dp[tmp]) {
            tmp = q.top().ss;
         } else if (dp[q.top().ss] == dp[tmp]) {
            tmp = max(tmp, q.top().ss);
         }
         q.pop();
      }
      q.push({prefsum[i] * 2 - prefsum[tmp], i});
      dp[i] = dp[tmp] + 1;
   }
   
   cout << dp[n] << '\n';

   return 0;
}

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