首页 > 代码库 > HDU 3507 Print Article 斜率优化

HDU 3507 Print Article 斜率优化

2024-07-07 03:29:31   223人阅读

Print Article

Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 4810    Accepted Submission(s): 1451


Problem Description
Zero has an old printer that doesn‘t work well sometimes. As it is antique, he still like to use it to print articles. But it is too old to work for a long time and it will certainly wear and tear, so Zero use a cost to evaluate this degree.
One day Zero want to print an article which has N words, and each word i has a cost Ci to be printed. Also, Zero know that print k words in one line will cost

M is a const number.
Now Zero want to know the minimum cost in order to arrange the article perfectly.
 

 

Input
There are many test cases. For each test case, There are two numbers N and M in the first line (0 ≤ n ≤ 500000, 0 ≤ M ≤ 1000). Then, there are N numbers in the next 2 to N + 1 lines. Input are terminated by EOF.
 

 

Output
A single number, meaning the mininum cost to print the article.
 

 

Sample Input
5 5 5 9 5 7 5
 

 

Sample Output
230
 
 
第一次写斜率优化，代码很丑。
斜率优化模式为dp[i]=min(a[j]*b[i]+c[j])+d[i]
与本题f[i]=min(f[j]-2*sum[j]*sum[i]+sum[j]^2)+sum[i]^2+m相符。
另外，表示凸包写的还是很不熟练。
 
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
#define MAXN 510000
#define INF 0x3f3f3f3f
//AC
int n,m;
int num[MAXN];
typedef long long qword;
qword f[MAXN];
qword sum[MAXN];
inline qword sqr(int x)
{
        return x*x;
}
//f[i]=min(f[j]-2*sum[j]*sum[i]+sum[j]^2)+sum[i]^2+m
//f[i]=-2*sum[j]*sum[i] + f[j]+sum[j]^2 +sum[i]^2 + m
//  -2*sum[i]*sum[j] + sum[i]^2-f[i]+m == -f[j]-sum[j]^2
struct Point
{
        qword x,y;
        void init(qword xx,qword yy)
        {
                x=xx;y=yy;
        }
};
Point make_point (qword x,qword y)
{
        Point ret;
        ret.init(x,y);
        return ret;
}
qword xmul(Point p1,Point p2,Point p3)
{
        return (p2.x-p1.x)*(p3.y-p1.y)-(p2.y-p1.y)*(p3.x-p1.x);
}
double get_k(Point p1,Point p2)
{
        if (p1.x==p2.x)throw "error";
        return (double)(p2.y-p1.y)/(p2.x-p1.x);
}
struct Convex_Hall
{
        Point pl[MAXN];
        double kk[MAXN];
        int topl;
        void clear()
        {
                topl=-1;
        }

        Convex_Hall()
        {
                topl=-1;
        }
        void add_point(Point pp)
        {
                if (topl<1)
                {
                        pl[++topl]=pp;
                        if (topl==1&&pl[topl].x==pl[topl-1].x)
                        {
                                if (pl[topl].y<pl[topl-1].y)
                                {
                                        topl--;
                                        return ;
                                }else
                                {
                                        pl[topl--]=pp;
                                        return ;
                                }

                        }
                        if (topl==1)
                        {
                                kk[topl-1]=get_k(pl[topl-1],pl[topl]);
                        }
                        return ;
                }
                while (topl>=1&&xmul(pl[topl-1],pl[topl],pp)>=0)
                {
                        topl--;
                }
                pl[++topl]=pp;
                kk[topl-1]=get_k(pl[topl-1],pp);
        }
        void pm()
        {
                int i;
                for(i=0;i<=topl;i++)
                {
                        printf("(%d,%d) ",pl[i].x,pl[i].y);
                }
                printf("\n");
        }
        double get_maxb(double k)
        {
                int l,r,mid;
                if (topl==-1)throw "Error";
                if (topl==0)return pl[0].y-pl[0].x*k;
                if (k>kk[0])return pl[0].y-pl[0].x*k;
                if (k<kk[topl-1])return pl[topl].y-pl[topl].x*k;
                l=0,r=topl;
                while (l<r)
                {
                        mid=(l+r)>>1;
                        if (kk[mid-1]>=k&&kk[mid]<=k)
                        {
                                return pl[mid].y-pl[mid].x*k;
                        }
                        if (kk[mid-1]<k)
                        {
                                r=mid;
                        }else
                        {
                                l=mid;
                        }
                }
        }
}H;

int main()
{
        //freopen("input.txt","r",stdin);
        int i;
        while (~scanf("%d%d",&n,&m))
        {
                H.clear();
                for (i=1;i<=n;i++)
                {
                        scanf("%d",&num[i]);
                        sum[i]=sum[i-1]+num[i];
                }
                memset(f,INF,sizeof(f));
                /*        f[0]=0;
                        for (i=1;i<=n;i++)
                        {
                        for (j=0;j<i;j++)
                        {
                        if (f[j]>=INF)continue;
                        f[i]=min(f[i],f[j]+sqr(sum[i]-sum[j])+m);
                        }
                        }
                        for (i=1;i<=n;i++)cout<<f[i]<<" ";cout<<endl;
                 */        f[0]=0;
                H.add_point(make_point(sum[0],-sum[0]*sum[0]-f[0]));
                double k,b;
                for (i=1;i<=n;i++)
                {
                        k=-2*sum[i];
                        b=H.get_maxb(k);
                        f[i]=sum[i]*sum[i]+m-ceil(b);
                        H.add_point(make_point(sum[i],-sum[i]*sum[i]-f[i]));
                        //                cout<<f[i]<<" ";
                }
                cout<<f[n]<<endl;;
        }
        return 0;
}

 


联系
我们