제출 #39241

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
39241		qoo2p5	수열 (APIO14_sequence)	C++14	0 / 100	6 ms	26296 KiB

sequence

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

const int INF = (int) 1e9 + 1e6 + 123;
const ll LINF = (ll) 1e18 + 1e9 + 123;
const ld EPS = (ld) 1e-7;
const ll MOD = (ll) 1e9 + 7;

#define sz(x) (int) (x).size()
#define mp(x, y) make_pair(x, y)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lb(s, t, x) (int) (lower_bound(s, t, x) - s)
#define ub(s, t, x) (int) (upper_bound(s, t, x) - s)
#define rep(i, f, t) for (int i = f; i < t; i++)
#define per(i, f, t) for (int i = f; i >= t; i--)

ll power(ll x, ll y, ll mod = MOD) {
    if (y == 0) {
        return 1;
    }
    if (y & 1) {
        return power(x, y - 1, mod) * x % mod;
    } else {
        ll tmp = power(x, y / 2, mod);
        return tmp * tmp % mod;
    }
}

template<typename A, typename B> bool mini(A &x, const B &y) {
    if (y < x) {
        x = y;
        return true;
    }
    return false;
}

template<typename A, typename B> bool maxi(A &x, const B &y) {
    if (y > x) {
        x = y;
        return true;
    }
    return false;
}

void add(ll &x, ll y) {
	x += y;
	if (x >= MOD) x -= MOD;
	if (x < 0) x += MOD;
}

ll mult(ll x, ll y) {
	return x * y % MOD;
}

void run();

#define TASK ""

int main() {
#ifdef LOCAL
    if (strlen(TASK) > 0) {
        cerr << "Reminder: you are using file i/o, filename: " TASK "!" << endl << endl;
    }
#endif
#ifndef LOCAL
    if (strlen(TASK)) {
        freopen(TASK ".in", "r", stdin);
        freopen(TASK ".out", "w", stdout);
    }
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#endif
    cout << fixed << setprecision(12);
    run();
    return 0;
}

// == SOLUTION == //

const int N = (int) 10000 + 123;
const int K = 202;

int n, k;
ll a[N], p[N];
ll dp[N][K];
int from[N][K];
int ptr[K];

void run() {
	cin >> n >> k;
	rep(i, 1, n + 1) {
		cin >> a[i];
	}
	partial_sum(a, a + n + 1, p);
	
	rep(i, 0, N) {
		rep(j, 0, K) {
			dp[i][j] = -LINF;
		}
		dp[i][0] = (i == 0 ? -LINF : 0);
	}
	
	rep(r, 1, n + 1) {
		if (r <= k + 1) {
			ptr[r - 1] = r;
		}
		
		rep(t, 1, min(k + 1, r)) {
			auto f = [&] (const int l) {
				return dp[l - 1][t - 1] + p[l - 1] * (p[r] - p[l - 1]);
			};
			
			while (ptr[t] + 1 <= r && f(ptr[t] + 1) > f(ptr[t])) {
				ptr[t]++;
			}
			dp[r][t] = f(ptr[t]);
			from[r][t] = ptr[t];
		}
	}
	
	cout << dp[n][k] << "\n";
	vector<int> what(k);
	per(i, k, 1) {
		what[i - 1] = from[n][i] - 1;
		n = from[n][i] - 1;
	}
	for (int pos : what) {
		cout << pos << " ";
	}
	cout << "\n";
}

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

sequence.cpp: In function 'int main()':
sequence.cpp:72:40: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(TASK ".in", "r", stdin);
                                        ^
sequence.cpp:73:42: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(TASK ".out", "w", stdout);
                                          ^

• Subtask 1: 0 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29