Untitled diff

Criado O diff nunca expira
1 remoção
56 linhas
2 adições
56 linhas
#define _CRT_SECURE_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <bits/stdc++.h>
#define pb push_back
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i=0; i<n; ++i)
#define rep(i, n) for (int i=0; i<n; ++i)
#define rrep(i, n) for (int i=1; i<=n; ++i)
#define rrep(i, n) for (int i=1; i<=n; ++i)
#define ff first
#define ff first
#define ss second
#define ss second
using namespace std;
using namespace std;
typedef long long ll;
typedef long long ll;


ll dp[820][8010];
ll dp[820][8010];
ll sum[8010];
ll sum[8010];
int L, G;
int L, G;
ll c[8010];
ll c[8010];
ll ans = 9000000000000LL;
ll ans = 9000000000000LL;
const ll inf = 9000000000000LL;
const ll inf = 0x3f3f3f3f3f3f3f3f;


void f(int t, int s, int e, int l, int r) {
void f(int t, int s, int e, int l, int r) {
// s에서 e 사이 답이 l에서 r 사이
// s에서 e 사이 답이 l에서 r 사이
if (s > e) return;
if (s > e) return;
if (t == 1) {
if (t == 1) {
int m = s + e >> 1;
int m = s + e >> 1;
dp[t][m] = sum[m] * m;
dp[t][m] = sum[m] * m;
f(t, s, m - 1, l, r);
f(t, s, m - 1, l, r);
f(t, m + 1, e, l, r);
f(t, m + 1, e, l, r);
return;
return;
}
}
int m = s + e >> 1;
int m = s + e >> 1;
ll M = inf, idx=l;
ll M = inf, idx=l;
for (int i = l; i <= min(r, m); i++) {
for (int i = l; i <= min(r, m); i++) {
if (M > (sum[m] - sum[i]) * (m - i) + dp[t - 1][i]) {
if (M > (sum[m] - sum[i]) * (m - i) + dp[t - 1][i]) {
M = (sum[m] - sum[i]) * (m - i) + dp[t - 1][i];
M = (sum[m] - sum[i]) * (m - i) + dp[t - 1][i];
idx = i;
idx = i;
}
}
}
}
dp[t][m] = M;
dp[t][m] = M;
f(t, s, m - 1, l, idx);
f(t, s, m - 1, l, idx);
f(t, m + 1, e, idx, r);
f(t, m + 1, e, idx, r);
return;
return;
}
}


int main(void) {
int main(void) {
//freopen("C:\\Users\\User\\Downloads\\prob3_gold_dec22\\19.in", "r", stdin);
//freopen("C:\\Users\\User\\Downloads\\prob3_gold_dec22\\19.in", "r", stdin);
ios::sync_with_stdio(false);
ios::sync_with_stdio(false);
cin.tie(NULL);
cin.tie(NULL);
cout.tie(NULL);
cout.tie(NULL);
cin >> L >> G;
cin >> L >> G;
rrep(i, L) {
rrep(i, L) {
cin >> c[i]; sum[i] = sum[i - 1] + c[i];
cin >> c[i]; sum[i] = sum[i - 1] + c[i];
}
}
rrep(i, G) {
rrep(i, G) {
f(i, 1, L, 0, L);
f(i, 1, L, 0, L);
}
}
cout << dp[G][L];
cout << dp[G][L];
}
}