제출 #56952

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
56952		Plurm	수열 (APIO14_sequence)	C++11	71 / 100	2050 ms	105688 KiB

sequence

#pragma GCC optimize("Ofast")
#include <cstdio>
#include <vector>
#include <algorithm>
#include <stack>
#define bad(x,y,z) ((C[y]-C[x])*(M[x]-M[z]) >= (C[z]-C[x])*(M[x]-M[y]))
using namespace std;
int a[131072];
long long dp[131072][2]; // End with i, having j parts;
long long qs[131072];
int par[131072][256];
vector<int> M;
vector<long long> C;
vector<int> idx;
inline void add(int i, int m, long long c){
	M.push_back(m);
	C.push_back(c);
	idx.push_back(i);
	while(M.size() >= 3 && bad(M.size()-3, M.size()-2, M.size()-1)){
		M.erase(M.end()-2);
		C.erase(C.end()-2);
		idx.erase(idx.end()-2);
	}
}
int ptr;
inline int query(long long& x){
	if(ptr >= M.size()) ptr = M.size()-1;
	while(ptr < M.size()-1 && M[ptr+1]*x + C[ptr+1] > M[ptr]*x + C[ptr]) ptr++;
	return ptr;
}
inline int fastscan(){
	int x = 0;
	int c = getchar();
	while(c < 48 || c >= 58) c = getchar();
	while(c >= 48 && c < 58){
		x *= 10;
		x += c-48;
		c = getchar();
	}
	return x;
}
int main(){
	int n,k;
	n = fastscan();
	k = fastscan();
	k++;
	add(0,0,0);
	for(int i = 1; i <= n; i++){
		a[i] = fastscan();
		qs[i] = qs[i-1] + (long long)a[i];
		dp[i][0] = -1e16;
	}
	for(int j = 1; j <= k; j++){
		if(j > 1) add(j-1,qs[j-1], dp[j-1][(j+1) % 2] - qs[j-1]*qs[j-1]);
		for(int i = j; i <= n; i++){
			int id = query(qs[i]);
			par[i][j] = idx[id];
			dp[i][j % 2] = M[id]*qs[i] + C[id];
			add(i,qs[i], dp[i][(j+1) % 2] - qs[i]*qs[i]);
		}
		M.clear();
		C.clear();
		idx.clear();
		ptr = 0;
	}
	printf("%lld\n",dp[n][k % 2]);
	int x = n;
	stack<int> stk;
	for(int j = k; j > 1; j--){
		x = par[x][j];
		stk.push(x);
	}
	while(!stk.empty()){
		printf("%d ",stk.top());
		stk.pop();
	}
}

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

sequence.cpp: In function 'int query(long long int&)':
sequence.cpp:27:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(ptr >= M.size()) ptr = M.size()-1;
     ~~~~^~~~~~~~~~~
sequence.cpp:28:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(ptr < M.size()-1 && M[ptr+1]*x + C[ptr+1] > M[ptr]*x + C[ptr]) ptr++;
        ~~~~^~~~~~~~~~~~

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