제출 #106916

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
106916		nxteru	수열 (APIO14_sequence)	C++14	22 / 100	299 ms	92280 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll,ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 1000000000000000000
struct t{
	ll x,y,q;
};
bool check(t a,t b,t c){
	return (__int128)(c.y-b.y)*(__int128)(a.x-b.x)<=(__int128)(b.y-a.y)*(__int128)(b.x-c.x);
}
int n,m,b[205][100005],l,r;
ll dp[2][100005],s[100005];
t dq[100005];
vector<int>ans;
int main(void){
	scanf("%d%d",&n,&m);
	m++;
	for(int i=1;i<=n;i++){
		ll a;
		scanf("%d",&a);
		s[i]=s[i-1]+a;
	}
	for(int j=0;j<=n;j++)dp[0][j]=INF;
	dp[0][0]=0;
	for(int i=1;i<=m;i++){
		l=0,r=0;
		int o=(i-1)%2,p=i%2;
		for(int j=0;j<=n;j++)dp[p][j]=INF;
		for(int j=1;j<=n;j++){
			if(dp[i-1][j-1]<INF){
				t p=t{-2LL*s[j-1],s[j-1]*s[j-1]+dp[o][j-1],j-1};
				while(r-2>=l&&check(dq[r-2],dq[r-1],p))r--;
				dq[r++]=p;
				while(l+1<r&&dq[l].x*s[j]+dq[l].y>=dq[l+1].x*s[j]+dq[l+1].y)l++;
			}
			if(l<r){
				b[i][j]=dq[l].q;
				dp[p][j]=dq[l].x*s[j]+dq[l].y+s[j]*s[j];
			}
		}
	}
	printf("%lld\n",(s[n]*s[n]-dp[m%2][n])/2LL);
	int x=n;
	for(int i=m;i>1;i--){
		ans.PB(b[i][x]);
		x=b[i][x];
	}
	for(int i=ans.size()-1;i>=0;i--){
		printf("%d",ans[i]);
		if(i==0)printf("\n");
		else printf(" ");
	}
}

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

sequence.cpp: In function 'int main()':
sequence.cpp:26:16: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'll* {aka long long int*}' [-Wformat=]
   scanf("%d",&a);
              ~~^
sequence.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~
sequence.cpp:26:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a);
   ~~~~~^~~~~~~~~

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