Submission #894442

#TimeUsernameProblemLanguageResultExecution timeMemory
894442vjudge1Bigger segments (IZhO19_segments)C++17
37 / 100
1554 ms3364 KiB
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
 #pragma GCC optimize("Ofast,unroll-loops,fast-math")
 #pragma GCC target("popcnt")


typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back

const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(1e5)+100;
const int M = ll(2e5) + 100;
const long long inf = 2e18;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }

ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}

void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }

int n, a[N];
ll pr[N];
pair<ll, ll> dp[N];

//bool check(int seg) {
//	if(seg == n) return true;
//	
//}

void Baizho() {
	cin>>n;
	for(int i = 1; i <= n; i ++) {
		cin>>a[i];
		pr[i] = pr[i - 1] + a[i];
	}
	for(int i = 1; i <= n; i ++) {
		for(int j = 0; j < i; j ++) {
			if(dp[j].ss + pr[j] <= pr[i]) {
				if(dp[j].ff + 1 > dp[i].ff) dp[i] = {dp[j].ff + 1, pr[i] - pr[j]};
				else if(dp[j].ff + 1 == dp[i].ff) dp[i].ss = min(pr[i] - pr[j], dp[i].ss);
			}
		}
	}
	cout<<dp[n].ff;
//	int l = 1, r = n;
//	while(l <= r) {
//		int mid = (l + r) / 2;
//		if(check(mid)) l = mid + 1;
//		else r = mid - 1;
// 	}
// 	cout<<l - 1<<"\n";
}
 
signed main() {		
// 	Freopen("deleg");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;

    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message (stderr)

segments.cpp: In function 'void Freopen(std::string)':
segments.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
segments.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...