제출 #370423

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
370423		fhvirus	Bigger segments (IZhO19_segments)	C++17	37 / 100	13 ms	2924 KiB

segments

// Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii; typedef pair<ll, ll> pll;
#define ff first
#define ss second
#define pb emplace_back
#define FOR(i,n) for(int i = 0; i < (n); ++i)
#define FOO(i,a,b) for(int i = (a); i <= (b); ++i)
#define AI(x) (x).begin(),(x).end()
template<typename I> bool chmax(I &a, I b){ return a < b ? (a = b, true) : false;}
template<typename I> bool chmin(I &a, I b){ return a > b ? (a = b, true) : false;}
#ifdef OWO
#define debug(args...) LKJ("[ " + string(#args) + " ]", args)
void LKJ(){ cerr << endl;}
template<typename I, typename...T> void LKJ(I&&x, T&&...t){ cerr<<x<<", ", LKJ(t...);}
template<typename I> void DE(I a, I b){ while(a < b) cerr<<*a<<" \n"[next(a)==b], ++a;}
#else
#define debug(...) 0
#define DE(...) 0
#endif
const int N = 5e5 + 225;
int n, a[N];
ll s[N];

int32_t main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n; FOO(i,1,n) cin >> a[i];
	FOO(i,1,n) s[i] = s[i-1] + a[i];

	assert(n <= 3000);

	vector<int> dp(n + 1, 0);
	vector<ll> mn(n + 1, 4e18);
	mn[0] = 0;
	FOO(i,1,n){
		FOR(j,i){
			ll sum = s[i] - s[j];
			if(sum < mn[j]) continue;
			if(dp[j] + 1 > dp[i]){
				dp[i] = dp[j] + 1;
				mn[i] = sum;
			} else if(dp[j] + 1 == dp[i]){
				chmin(mn[i], sum);
			}
		}
	}
	cout << dp[n] << '\n';

	return 0;
}

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