제출 #717902

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

sequence

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<long long, long long> pll;
typedef pair<int,int> pii;
typedef vector<long long> vl;
typedef vector<int> vi;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
clock_t startTime;
double getCurrentTime() {
	return (double)(clock() - startTime) / CLOCKS_PER_SEC;
}
ll set_on(ll n, ll k){
	return (n |= 1 << k);
}
ll set_off(ll n, ll k){
	return (n &= ~(1UL << k));
}
bool check_bit(ll n, ll k){
	int bit = (n >> k) & 1U;
	if(bit == 1)
		return true;
	return false;
}
int n, k;
vi arr;
void solve(){
	cin>>n>>k;
	arr.resize(n);
	for(int i = 0; i < n; i++){
		cin>>arr[i];
	}
	
	ll dp[n][k+1]; // dp i,j, maximum ans up to i if we have used j splits;
	memset(dp, 0, sizeof dp);
	int ancestor[n][k+1];
	memset(ancestor, -1, sizeof ancestor);
	ll sum = 0;
	for(int i = 1; i < n; i++)	sum += arr[i];
	dp[0][1] = arr[0] * sum;
	ll right_sum = sum;
	for(int i = 1; i < n; i++){
		right_sum -= arr[i];
		debug(i, right_sum);
		for(int splits = 0; splits <= k; splits++){
			ll cur_sum = 0;
			for(int j = i ; j >= 0; j--)
			{
				cur_sum += arr[j];
				if(j > 0 && splits > 1)
				{
					if(dp[i][splits] < dp[j-1][splits-1] + cur_sum * right_sum){
						dp[i][splits] = dp[j-1][splits-1] + cur_sum * right_sum;
						ancestor[i][splits] = j-1;
					}
				}
			}
		}
	}
	ll ans = 0;
	int start = n-1, sp = k;
	for(int i = 0; i < n; i++){
		if(ans < dp[i][k]){
			ans = dp[i][k];
			start = i;
		}
	}
	vi splits;
	while(sp >= 0 && ancestor[start][sp] != -1){
		splits.pb(start + 1);
		start = ancestor[start][sp];
		sp--;
	}
	splits.pb(start+1);
	reverse(splits.begin(), splits.end());
	cout<<ans<<endl;
	for(auto t : splits)
		cout<<t<<" ";
	cout<<endl;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.precision(10);
	cout<<fixed;
	startTime = clock();
	int t=1;
//	cin>>t;
	while(t--)
		solve();

	return 0;
}

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