hdu 2829 Lawrence 斜率优化dp

题目链接

---

题意：

序列划分n个数，分成m+1组(每组的数位置连续)，每组的分值为其中两两数之积，求分值和最小值。(1≤n≤1000)

---

解法：

关键点：score[le+1][ri]=score[1][ri]-score[1][le]-sum[le+1][ri]*sum[1][le];
用这个可变形成斜率式。

---

代码：

#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define for0(a, n) for (int (a) = 0; (a) < (n); (a)++)
#define for1(a, n) for (int (a) = 1; (a) <= (n); (a)++)
#define mes(a,x,s)  memset(a,x,(s)*sizeof a[0])
#define mem(a,x)  memset(a,x,sizeof a)
#define ysk(x)  (1<<(x))
typedef long long ll;
typedef pair<int, int> pii;
const int INF =0x3f3f3f3f;
const int maxN= 1000   ;

int N,M,dp[maxN+5][maxN+5];
int a[maxN+5],sum[maxN+5],S[maxN+5];
int m,q[maxN+5];


int getY(int j)
{
    return dp[m-1][j]-S[j]+sum[j]*sum[j];
}

int getX(int j)
{
    return sum[j];
}

int Cross(int j2,int j1,int i)
{
    return  (getX(j1)-getX(j2) )*(getY(i)-getY(j1))-(getX(i)-getX(j1))*(getY(j1)-getY(j2)  );
}
void solve()
{
   dp[0][0]=0;
   for( m=1;m<=M;m++)
   {
       int rear=0,front=0;
       q[rear++]=m-1;
       for(int i=m;i<=N;i++)
       {
           while(rear-front>=2&& (getY(q[front+1])-getY(q[front]))-(getX(q[front+1])-getX(q[front]) )*sum[i]<=0) front++;
           int j=q[front];
           dp[m][i]=dp[m-1][j]+S[i]-S[j]-(sum[i]-sum[j])*sum[j];

           if(m>1)
           {
                while(rear-front>=2&&Cross(q[rear-2],q[rear-1],i)<=0   )  rear--;

                q[rear++]=i;
           }

       }
   }
   printf("%d\n",dp[M][N]);
}
int main()
{
   std::ios::sync_with_stdio(false);
   while(cin>>N>>M&&(N||M))
   {
       M++;
       sum[0]=0;
       S[0]=0;
       for1(i,N)
       {
           cin>>a[i];
           sum[i]=sum[i-1]+a[i];
           S[i]=S[i-1]+ sum[i-1]*a[i];
       }
       solve();

   }

   return 0;
}