1911: [Apio2010]特别行动队
Time Limit: 4 Sec Memory Limit: 64 MBSubmit: 4662 Solved: 2253
[ Submit][ Status][ Discuss]
Description
Input
Output
Sample Input
4
-1 10 -20
2 2 3 4
-1 10 -20
2 2 3 4
Sample Output
9
HINT
一般的做法是n方动归,但是n有1000000,果断换方法,但是还能怎么优化呢,
看了题解,学了一发斜率优化(因决策点具有单调性),长了一波姿势。。。。。
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
typedef long long ll;
#define maxn 1000004
ll q[maxn],x[maxn],dp[maxn],sum[maxn],a,b,c;
int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return f*x;
}
double slop(int j,int i)
{
return (double)(dp[i]-dp[j]+a*sum[i]*sum[i]-a*sum[j]*sum[j]+b*(sum[j]-sum[i]))/(double)(2*a*(sum[i]-sum[j]));
}
int main(void)
{
ll n,l=0,i,j,r=0;
n=read();a=read();
b=read();c=read();
for(i=1;i<=n;i++)
{
x[i]=read();
sum[i]=sum[i-1]+x[i];
}
for(i=1;i<=n;i++)
{
while(l<r && slop(q[l],q[l+1])<sum[i])
l++;
ll tmp=q[l];
dp[i]=dp[tmp]+a*(sum[i]-sum[tmp])*(sum[i]-sum[tmp])+b*(sum[i]-sum[tmp])+c;
while(l<r && slop(q[r-1],q[r])>slop(q[r],i))
r--;
q[++r]=i;
}
printf("%lld\n",dp[n]);
return 0;
}