ZOJ 3463 DP

F[I][l][r]表示弹到了第I个位置，左手在L右手在R。

/*
 * Author:  xioumu
 * Created Time:  2011-10-20 18:01:02
 * File Name: p3463.cpp
 */
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<iostream>
#define MAXN 1011
#define MAXNUM 200000000
using namespace std;
int L,R,n;
int f[MAXN][60][60],a[MAXN];
void init()
{
   int i,j,k,r,w;
   for(i=1;i<=n;i++)
      scanf("%d",&a[i]);
}
//int min(int a,int b) { return a<b?a:b; }
//int max(int a,int b) { return a>b?a:b; }
void myput(int a[60][60])
{
   int i,j;
   for(i=0;i<=10;i++,printf("\n"))
      for(j=0;j<=51;j++)
         printf("%d ",a[i][j]);
   printf("\n");
}
void solve()
{
   int i,j,k,r,w,l,ans;
   for(i=0;i<=n;i++)
      for(j=0;j<=51;j++)
         for(k=0;k<=51;k++)
            f[i][j][k] = MAXNUM;
   
   //for(l=max(4,a[1]);l<=min(51,a[1]+8);l++)
         //f[1][l][R] = floor( sqrt( abs(L-l) ));
   //for(r=min(47,a[1]);r>=max(0,a[1]-8);r--)
         //f[1][L][r] = floor( sqrt( abs(R-r) ));
   
   //myput(f[1]);
   f[0][L][R] = 0;   
   for(i=1;i<=n;i++)
   {  
      for(l=4;l<=51;l++)
         for(r=0;r<=47;r++)
            if(f[i-1][l][r] < MAXNUM)
            {  k = min(51,a[i]+8);
               for(j=max(4,a[i]);j<=k;j++)
                  f[i][j][r] = min(f[i][j][r], f[i-1][l][r] + (int)( sqrt( abs(l-j))));
               
               k = max(0,a[i]-8);
               for(j=min(47,a[i]);j>=k;j--)
                  f[i][l][j] = min(f[i][l][j], f[i-1][l][r] + (int)( sqrt( abs(r-j))));
               
               //printf("--------\n");
            }
      //ans = 20000000;
      //for(l=0;l<=51;l++)
         //for(r=0;r<=51;r++)
            //ans = min(ans,f[i][l][r]);
      //printf("%d\n",ans);   
   }
   
   ans = MAXNUM;
      for(l=0;l<=51;l++)
         for(r=0;r<=51;r++)
            ans = min(ans,f[n][l][r]);
   printf("%d\n",ans);
}
int main()
{
   while(scanf("%d %d %d",&L,&R,&n) != EOF)
   {  init();
      solve();
   }
   return 0;
}