| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 761590 | gggkik | 도넛 (JOI14_ho_t3) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int MXN = 1e5+5;
#define ll long long
ll A[MXN], P[MXN], n, all;
vector<ll> sa, sb;
int cut(ll x,int i){
ll ans = 0;
for(int i = 1;i<=n;i++){
for(int j = i;j<=n;j++){ // [i,j] [j+1,k] [k+1,n]+[1,i-1]
for(int k = j+1;k<=n;k++){
ans = max(ans,min({sum(i,j),sum(j+1,k),sum(k+1,n)+sum(1,i-1)}));
}
}
}
return ans;
}
int f(ll x){ // 답이 x 이상인가?
for(int i = 0;i<n;i++) // i에서 cut
if(cut(x,i)>=x) return 1;
return 0;
}
ll sum(int i,int j){return (i<=j?P[j]-P[i-1]:0);}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
ll nans = 0;
for(int i = 1;i<=n;i++){
cin >> A[i]; P[i] = P[i-1]+A[i];
}
all = P[n];
ll suma = 0, sumb = 0;
sa.push_back(0);
for(int t = 0;t<2;t++)
for(int i = 1;i<=n;i++){
suma += A[i]; sa.push_back(suma);
}
for(int i = n;i>0;i--){
sumb += A[i]; sb.push_back(sumb);
}
for(int i = 0;i<=n;i++) sb.push_back(-P[i]);
sort(sb.begin(),sb.end());
ll l = 0, r = all;
for(;l+1<r;){
ll mid = l+r>>1;
if(f(mid)) l = mid;
else r = mid;
}
cout << l;
}