Submission #15774

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
15774	2015-07-22T10:29:32 Z	comet	달리는 게임 (kriii3_E)	C++	0 / 70	0 ms	32972 KB

E

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
ll s[1000010],d[1000010],p[1000010],p2[1000010];
vector<ll> a,b;
void push(ll n,ll m){
	int sz=a.size();
	while(  sz>1  &&  (b[sz-1]-b[sz-2])*(a[sz-1]-n)  >=  (m-b[sz-1])*(a[sz-2]-a[sz-1])  ){
		sz--;
		a.pop_back();
		b.pop_back();
	}
	a.push_back(n);
	b.push_back(m);
}
ll query(ll x){
	if(a.size()==1)return a[0]*x+b[0];
	int lo=0,hi=a.size(),mid;
	while(lo+1<hi){
		mid=(lo+hi)/2;
		if(b[mid]-b[mid-1]<x*(a[mid-1]-a[mid])){
			hi=mid;
		}
		else{
			lo=mid;
		}
	}
	return a[lo]*x+b[lo];
}
int main(){
	ll n,ans=0;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>s[i];
		p[i]=p[i-1]+s[i];
		p2[i]=p2[i-1]+i*s[i];
	}
	push(-1,-p2[1]+p[1]);
	for(ll i=1;i<=n;i++){
		d[i]=p2[i];
		/*for(ll j=0;j<i;j++){
			d[i]=max(d[i],  -(j+1)*p[i]  +d[j]-p2[j+1]+(j+1)*p[j+1]  +p2[i]  );
		}*/
		d[i]=max(d[i],query(p[i])+p2[i]);
		push(-(i+1),d[i]-p2[i+1]+(i+1)*p[i+1]);
	}
	cout<<d[n];
}

Subtask #1

0.0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	32972 KB	Output is correct
2	Incorrect	0 ms	32972 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2

0.0 / 44.0

#	Verdict	Execution time	Memory	Grader output
1	Halted	0 ms	0 KB	-