제출 #403230

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
403230		SavicS	수열 (APIO14_sequence)	C++14	100 / 100	1903 ms	83756 KiB

sequence

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)
 
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 100005;
const ll inf = 1e18 + 5;
 
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)
 
int n, K;
int niz[maxn];
 
ll pref[maxn];
 
ll dp[maxn][2];
int put[maxn][205];
 
void divi(int lvl, int tl, int tr, int l, int r) {
    if(l > r)return;
    int mid = (l + r) / 2;
 
    dp[mid][lvl & 1] = -inf;
 
    int opt = 0;
    ff(i,tl,min(mid,tr)) {
    	ll kol = (pref[mid] - pref[i - 1]) * (pref[n] - pref[mid]);
        if(dp[i - 1][!(lvl & 1)] + kol >= dp[mid][lvl & 1]) {
            dp[mid][lvl & 1] = dp[i - 1][!(lvl & 1)] + kol;
            opt = i;
        }
    }
 
    put[mid][lvl] = opt - 1;
 
    divi(lvl, tl, opt, l, mid - 1);
    divi(lvl, opt, tr, mid + 1, r);
 
}
 
int main() 
{
    ios::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
    cin >> n >> K;
    ff(i,1,n)cin >> niz[i];
 
    ff(i,1,n)pref[i] = pref[i - 1] + niz[i];
 
    K += 1;
    ff(i,1,n)dp[i][1] = pref[i] * (pref[n] - pref[i]);
 
    ff(j,2,K)divi(j,1,n,1,n);
    vector<int> res;
 
	cout << dp[n][K & 1] << '\n';
	int cur = n;
	fb(i,K,2)cout << put[cur][i] << " ", cur = put[cur][i];
		 
    return 0;
}
/**
 
 
2 1
0 123
 
 
9 4
51 57 35 8 14 30 2 55 13
 
 
7 3
4 1 3 4 0 2 3
 
4 1 3 |
 
// probati bojenje sahovski ili slicno
 
**/

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