제출 #652450

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
652450		ssense	수열 (APIO14_sequence)	C++14	50 / 100	187 ms	10360 KiB

sequence

#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define pb push_back
#define sc second
#define fr first
#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu

const int N = 1000;
const int K = 200;

pair<int, short> dp[N+5][K+5];

void solve()
{
    int n, k;
    cin >> n >> k;
    vint a = read(n);
    prefix_sum pref;
    pref.build(a);
    for(int i = 0; i <= n; i++)
    {
        dp[0][i] = {0, -1};
    }
    for(int i = 1; i < n; i++)
    {
        for(int this_break = 1; this_break <= k; this_break++)
        {
            for(int last_break = 0; last_break < i; last_break++)
            {
                int now = dp[last_break][this_break-1].fr+pref.get(last_break+1, i)*pref.get(i+1, n);
                if(dp[i][this_break].fr <= now)
                {
                    dp[i][this_break] = {now, last_break};
                }
            }
        }
    }
    int score = 0;
    int end = 0;
    for(int i = 1; i < n; i++)
    {
        if(score <= dp[i][k].fr)
        {
            score = max(score, dp[i][k].fr);
            end = i;
        }
    }
    cout << score << endl;
    while(k != 0)
    {
        cout << end << " ";
        end = dp[end][k--].sc;
    }
}
 
int32_t main(){
    startt
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}
/*
7 3
4 1 3 4 0 2 3
 */

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

sequence.cpp: In member function 'void prefix_sum::build(std::vector<long long int>)':
sequence.cpp:20:667: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 | int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         ~~^~~~~~~~~~

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