제출 #544243

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
544243		SavicS	수열 (APIO14_sequence)	C++17	33 / 100	2090 ms	131072 KiB

sequence

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
 
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for (auto& a : x)
 
#define sz(a) (int)(a).size()
#define pb push_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const ll inf = 1e18 + 5;
const int mxN = 200005; 

int n, k;
int niz[mxN];

int pref[mxN];

ll dp[mxN][201];

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> k; k += 1;
    ff(i,1,n)cin >> niz[i];

    ff(i,1,n)pref[i] = pref[i - 1] + niz[i];

    ff(i,0,n)ff(j,0,k)dp[i][j] = -inf;

    dp[0][0] = 0;
    ff(i,1,n){
        ff(j,1,k){
            fb(l,i,1){
                dp[i][j] = max(dp[i][j], dp[l - 1][j - 1] + 1ll * (pref[i] - pref[l - 1]) * (pref[n] - pref[i]));
            }
        }
    }


    int i = n, j = k; vector<int> res;
    while(1){

        fb(l,i,1){
            if(dp[l - 1][j - 1] + 1ll * (pref[i] - pref[l - 1]) * (pref[n] - pref[i]) == dp[i][j]){
                i = l - 1; j -= 1;
                break;
            }
        }    

        if(i == 0)break;
        res.pb(i);

    }

    cout << dp[n][k] << '\n';
    for(auto c : res)cout << c << " ";
    cout << '\n';

    return 0;
}
/*
 
7 3 
4 1 3 4 0 2 3
 
// probati bojenje sahovski
*/
 
 
 
 
 

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