제출 #48168

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
48168		tmwilliamlin168	수열 (APIO14_sequence)	C++11	62 / 100	407 ms	86112 KiB

sequence

#include <bits/stdc++.h>
using namespace std;

#define ll long long

const int mxN=1e5;
int n, k, prv[201][mxN+1], qh, qt;
ll ps[mxN+1], dp[2][mxN+1], a[mxN+1], b[mxN+1], c[mxN+1];

inline void al(ll ai, ll bi, ll ci) {
	if(qh-qt>=2&&a[qt-1]==ai) {
		if(bi<b[qt-1])
			--qt;
		else
			return;
	}
	while(qh-qt>=2&&(b[qt-1]-b[qt-2])/(a[qt-2]-a[qt-1])>=(bi-b[qt-1])/(a[qt-1]-ai))
		--qt;
	a[qt]=ai;
	b[qt]=bi;
	c[qt]=ci;
	++qt;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> k;
	for(int i=0; i<n; ++i)
		cin >> ps[i+1], ps[i+1]+=ps[i];
	for(int i=1; i<=n; ++i)
		dp[1][i]=1e18;
	for(int i=0; i<=k; ++i) {
		qh=qt=0;
		al(-2*ps[i], ps[i]*ps[i]+dp[i&1^1][i], i);
		for(int j=i+1; j<=n; ++j) {
			while(qt-qh>=2&&a[qh+1]*ps[j]+b[qh+1]<=a[qh]*ps[j]+b[qh])
				++qh;
			dp[i&1][j]=ps[j]*ps[j]+a[qh]*ps[j]+b[qh];
			prv[i][j]=c[qh];
			al(-2*ps[j], ps[j]*ps[j]+dp[i&1^1][j], j);
		}
	}
	cout << (ps[n]*ps[n]-dp[k&1][n])/2 << "\n";
	for(int i=k, j=prv[k][n]; i; --i, j=prv[i][j])
		cout << j << " ";
} 

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

sequence.cpp: In function 'int main()':
sequence.cpp:36:32: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   al(-2*ps[i], ps[i]*ps[i]+dp[i&1^1][i], i);
                               ~^~
sequence.cpp:42:33: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
    al(-2*ps[j], ps[j]*ps[j]+dp[i&1^1][j], j);
                                ~^~

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