Submission #1152793

#	Time	Username	Problem	Language	Result	Execution time	Memory
1152793		KluydQ	수열 (APIO14_sequence)	C++20	0 / 100	2 ms	5188 KiB

sequence

#include <bits/stdc++.h>
//#include "grader.h"
 
#define respagold ios_base::sync_with_stdio(0), cin.tie(0);
#define int long long
#define ll long long
#define int2 __int128_t
#define FOR( i, x, n, d ) for( int i = x; i <= n; i += d )
#define FORR( i, x, n, d ) for( int i = x; i >= n; i -= d )
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x.size())
#define pb push_back
#define ins insert
#define lb lower_bound
#define ub upper_bound
#define pii pair <int, int>
#define mkp make_pair
 
using namespace std;
 
const int N = 1e5 + 123;
const int inf = 1e18;
 
int a[N], b[N], n, m, k, z, w, x, y, mm[N], cc[N];
int dp[N], par[N][201];
bool nel[N][201];

mt19937 rng( chrono::steady_clock::now().time_since_epoch().count());
 
int rand( int l, int r )
{
    uniform_int_distribution <int> uid( l, r );
    return uid( rng );
}
struct line
{
	int m, c, id;
	line( int m, int c, int id ): m(m), c(c), id(id) {}
	line(): m(0), c(-inf), id(0) {}
	int get( int x ) { return m * x + c; }
};
int calc( line a, line b )
{
	if( a.m == b.m ) return -inf;
	return ( b.c - a.c ) / ( a.m - b.m );
}
vector <line> ve;
line sv[N], sv1[N];

void add( line nw )
{
	int siz = sz(ve);
	while( siz > 1 && calc( ve[siz - 2], ve[siz - 1] ) > calc( ve[siz - 1], nw ) ) ve.pop_back(), siz --;
	ve.pb(nw);
}
pii get( int x )
{
	int l = 0, r = sz(ve) - 1, res = 0;
	
	while( l <= r )
	{
		int md = ( l + r ) >> 1;
		
		if(( md == 0 ? -inf : calc(ve[md], ve[md - 1]) ) <= x ) l = md + 1, res = md;
		else r = md - 1;
	}
	return { ve[res].get(x), ve[res].id };
}
void solve()
{
	cin >> n >> k;
	
	FOR( i, 1, n, 1 ) cin >> a[i], b[i] = b[i - 1] + a[i];
	sv1[0] = line( 0, 0, 0 );
	
	FOR( bl, 1, k, 1 )
	{
		FOR( i, bl, n - k + bl - 1, 1 )
		{
			// for i find k that ( dp[k] + sum(k + 1, i) * sum(i + 1, n) ) is max
			
			// dp[i] = dp[k] + ( b[i] - b[k] ) * ( b[n] - b[i] )
			// dp[i] = dp[k] + b[i] * b[n] - b[i] * b[i] - b[k] * b[n] + b[k] * b[i];
			// dp[i] = ( dp[k] - b[k] * b[n] ) + ( b[i] * b[n] - b[i] * b[i] ) + ( b[k] * b[i] )
			
			if( a[i - 1] != 0 || ( a[i - 1] == 0 && a[i] != 0 ) ) add( sv1[i - 1] );
			
			pii j = get( b[i] );
			dp[i] = j.F + b[i] * b[n] - b[i] * b[i];
			sv[i] = line( b[i], dp[i] - b[i] * b[n], i );
			par[i][bl] = j.S;
		}
		ve.clear();
		FOR( i, 1, n, 1 ) sv1[i] = sv[i];
	}
	int ans = -inf, id = 0;
	
	FOR( i, 1, n - 1, 1 )
	{
		if( dp[i] >= ans ) ans = dp[i], id = i;
	}
	vector <int> v;
	FORR( blo, k, 1, 1 ) v.pb( id ), id = par[id][blo];
	reverse( all( v ));
	cout << ans << '\n';
	for( auto i : v ) cout << i << ' ';
}
signed main() 
{
//	freopen("connect.in", "r", stdin);
//	freopen("connect.out", "w", stdout);
	    
    respagold
    
    int test = 1;
    
    if( !test ) cin >> test;
	
	while( test -- )
	{
		solve();
	}
}
// solved by KluydQ

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