| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 343991 | IZhO_2021_I_want_Silver | Bigger segments (IZhO19_segments) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>-
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// order_of_key (k) : Number of items strictly smaller than k .
// find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
#define int ll
const int N = (1 << 13) - 1;
const int oo = 1e15 + 5;
int n, a[N], sum[N], dp[N][N], ans, mn[N];
void solve() {
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
sum[i] = sum[i-1] + a[i];
}
for (int i = 1; i <= n; ++i) {
dp[i][1] = sum[i];
}
mn[n+1] = oo;
for (int i = n; i >= 1; --i) {
mn[i] = min(mn[i+1], dp[i][1] + sum[i]);
}
for (int k = 2; k <= n; ++k) {
for (int i = 1; i <= n; ++i) {
dp[i][k] = oo;
int l = 1, r = i-1;
while (l < r) {
int mid = (l + r + 1) / 2;
if (mn[mid] <= sum[i]) l = mid;
else r = mid - 1;
}
if (mn[l] <= sum[i]) { dp[i][k] = min(dp[i][k], sum[i] - sum[l]); }
}
for (int i = n; i >= 1; --i) {
mn[i] = min(mn[i+1], dp[i][k] + sum[i]);
}
}
int ans = 0;
for (int k = 1; k <= n; ++k) {
if (dp[n][k] != oo) { ans = k; }
}
cout << ans;
}
main () {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tests = 1;
//cin >> tests;
while (tests --) {
solve();
}
return 0;
}
/*
Just Chalish!
*/
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>-
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// order_of_key (k) : Number of items strictly smaller than k .
// find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
#define int ll
const int N = (1 << 13) - 1;
const int oo = 1e15 + 5;
int n, a[N], sum[N], dp[N][N], ans, mn[N];
void solve() {
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
sum[i] = sum[i-1] + a[i];
}
for (int i = 1; i <= n; ++i) {
dp[i][1] = sum[i];
}
mn[n+1] = oo;
for (int i = n; i >= 1; --i) {
mn[i] = min(mn[i+1], dp[i][1] + sum[i]);
}
for (int k = 2; k <= n; ++k) {
for (int i = 1; i <= n; ++i) {
dp[i][k] = oo;
int l = 1, r = i-1;
while (l < r) {
int mid = (l + r + 1) / 2;
if (mn[mid] <= sum[i]) l = mid;
else r = mid - 1;
}
if (mn[l] <= sum[i]) { dp[i][k] = min(dp[i][k], sum[i] - sum[l]); }
}
for (int i = n; i >= 1; --i) {
mn[i] = min(mn[i+1], dp[i][k] + sum[i]);
}
}
int ans = 0;
for (int k = 1; k <= n; ++k) {
if (dp[n][k] != oo) { ans = k; }
}
cout << ans;
}
main () {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tests = 1;
//cin >> tests;
while (tests --) {
solve();
}
return 0;
}
/*
Just Chalish!
*/