XTU 1206Dormitory's Elevator(dp)

Dormitory's Elevator
Accepted : 21		Submit : 191
Time Limit : 1000 MS		Memory Limit : 65536 KB

Problem Description The new dormitory has N(1≤N≤100000) floors and M(1≤M≤100000)students. In the new dormitory, in order to save student's time as well as encourage student exercise, the elevator in dormitory will not stop in adjacent floor. So if there are people want to get off the elevator in adjacent floor, one of them must walk one stair instead. Suppose a people go down 1 floor costs A energy, go up 1 floor costs B energy(1≤A,B≤100). Please arrange where the elevator stop to minimize the total cost of student's walking cost.All students and elevator are at floor 1 initially, and the elevator can not godown and can stop at floor 2. Input First line contain an integer T, there are T(1≤T≤10) cases. For each case T, there are two lines. First line: The number of floors N(1≤N≤100000), and the number of students M(1≤M≤100000),A,B(1≤A,B≤100) Second line: M integers (2≤A[i]≤N), the student's desire floor. Output Output case number first, then the answer, the minimum of the total cost of student's walking cost. Sample Input 1 3 2 1 1 2 3 Sample Output Case 1: 1 Source daizhenyang

首先要明确尽可能的电梯多停，画一下图，就能明白最开始停的位置为1或2，后面要停的楼i 可能是从第i-2或i-3层。

#include<stdio.h>
int main()
{
    int t,tt=0,n,m,k[100005],floot;
    __int64 A,B,dp[100005];
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%I64d%I64d",&n,&m,&A,&B);
        for(int i=0;i<=n;i++)
            k[i]=0;

        while(m--)
        {
            scanf("%d",&floot);k[floot]++;
        }
        __int64 a,b,c,d,e;
        dp[1]=0; dp[2]=0;
        for(int i=3; i<=n;i++)
        {
            b=(1<<30);
            if(B<=A)
                a=B*k[i-1]+dp[i-2];
            else
                a=A*k[i-1]+dp[i-2];
            if(i-3>0)
            {
                b=B*(k[i-2]+k[i-1]*2)+dp[i-3];
                c=B*k[i-2]+A*k[i-1]+dp[i-3];
                d=A*k[i-2]*2+B*k[i-1]*2+dp[i-3];
                e=A*(k[i-2]*2+k[i-1])+dp[i-3];
                if(b>c)b=c; if(b>d)b=d; if(b>e)b=e;
            }
            if(a>b)a=b;
            dp[i]=a;
        }
        printf("Case %d: %I64d\n",++tt,dp[n]);
    }
}