제출 #336321

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

segments

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
const int mod = 1e9+7, N = 100005, inf = 1e18;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val);}
int a[N], n, m, k;
vector<pii> dp[N];
int pr[N];
vector<int> pm[N];
void solve(int test_case){
	int i, j;
	cin >> n;
	for(i=1;i<=n;i++){
		cin >> a[i];
		pr[i]=a[i];pr[i]+=pr[i-1];
	}
	for(i=1;i<=n;i++){
		dp[i].pb({pr[i], 1});
		dp[i].pb({inf, -213234684});
		pm[i].pb(dp[i][0].ss);
		for(j=1;j<dp[i].size();j++)pm[i].pb(max(pm[i].back(), dp[i][j].ss));
	}
	for(i=2;i<=n;i++){
		for(j=1;j<i;j++){
			int s = pr[i]-pr[j];
			int pos = upper_bound(all(dp[j]), pii{s+1,-1})-dp[j].begin();pos--;
			if(pos<0)continue;
			int mx = pm[j][pos];
			dp[i].pb({s, mx+1});
		}sort(all(dp[i]));
		pm[i].clear();
		pm[i].pb(dp[i][0].ss);
		for(j=1;j<dp[i].size();j++)pm[i].pb(max(pm[i].back(), dp[i][j].ss));
	}
	int ans = 1;
	for(auto [x, y] : dp[n]){
		ans = max(ans, y);
	} 
	cout << ans << '\n';
	return;
}

signed main(){
	FASTIO;
#define MULTITEST 0
#if MULTITEST
	int ___T;
	cin >> ___T;
	for(int T_CASE = 1; T_CASE <= ___T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

segments.cpp: In function 'void solve(long long int)':
segments.cpp:29:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |   for(j=1;j<dp[i].size();j++)pm[i].pb(max(pm[i].back(), dp[i][j].ss));
      |           ~^~~~~~~~~~~~~
segments.cpp:41:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |   for(j=1;j<dp[i].size();j++)pm[i].pb(max(pm[i].back(), dp[i][j].ss));
      |           ~^~~~~~~~~~~~~

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