跑跑卡丁车（dp）

题意：https://www.nitacm.com/problem_show.php?pid=1470

 #define IOS ios_base::sync_with_stdio(0); cin.tie(0);
 #include <cstdio>//sprintf islower isupper
 #include <cstdlib>//malloc  exit strcat itoa system("cls")
 #include <iostream>//pair
 #include <fstream>//freopen("C:\\Users\\13606\\Desktop\\草稿.txt","r",stdin);
 #include <bitset>
 //#include <map>
 //#include<unordered_map>
 #include <vector>
 #include <stack>
 #include <set>
 #include <string.h>//strstr substr
 #include <string>
 #include <time.h>//srand(((unsigned)time(NULL))); Seed n=rand()%10 - 0~9;
 #include <cmath>
 #include <deque>
 #include <queue>//priority_queue<int, vector<int>, greater<int> > q;//less
 #include <vector>//emplace_back
 //#include <math.h>
 //#include <windows.h>//reverse(a,a+len);// ~ ! ~ ! floor
 #include <algorithm>//sort + unique : sz=unique(b+1,b+n+1)-(b+1);+nth_element(first, nth, last, compare)
 using namespace std;//next_permutation(a+1,a+1+n);//prev_permutation
 //******************
 int abss(int a);
 int lowbit(int n);
 int Del_bit_1(int n);
 int maxx(int a,int b);
 int minn(int a,int b);
 double fabss(double a);
 void swapp(int &a,int &b);
 clock_t __STRAT,__END;
 double __TOTALTIME;
 void _MS(){__STRAT=clock();}
 void _ME(){__END=clock();__TOTALTIME=(double)(__END-__STRAT)/CLOCKS_PER_SEC;cout<<"Time: "<<__TOTALTIME<<" s"<<endl;}
 //***********************
 #define rint register int
 #define fo(a,b,c) for(rint a=b;a<=c;++a)
 #define fr(a,b,c) for(rint a=b;a>=c;--a)
 #define mem(a,b) memset(a,b,sizeof(a))
 #define pr printf
 #define sc scanf
 #define ls rt<<1
 #define rs rt<<1|1
 typedef long long ll;
 const double E=2.718281828;
 const double PI=acos(-1.0);
 //const ll INF=(1LL<<60);
 const int inf=(<<);
 const double ESP=1e-;
 const int mod=(int)1e9+;
 const int N=(int)1e6+;

 int dp[N][];
 int a[N],b[N];

 int main()
 {
     int l,n;
     while(~sc("%d%d",&l,&n))
     {
         for(int i=;i<=l;++i)
         {
             int t;
             sc("%d",&t);
             for(int j=;j<n;++j)
                 a[i+j*l]=t;
         }
         for(int i=;i<=l;++i)
         {
             int t;
             sc("%d",&t);
             for(int j=;j<n;++j)
                 b[i+j*l]=t;
         }
         int tot=l*n;
         for(int i=;i<=tot;++i)
             for(int j=;j<=;++j)
                 dp[i][j]=inf;
         dp[][]=;

         for(int i=;i<=tot;++i)
         {
             for(int j=;j<=;++j)
             {
                 if(j!=&&dp[i-][j-]!=inf)
                     dp[i][j]=dp[i-][j-]+a[i];//不加速
                 if(dp[i-][]!=inf)
                     dp[i][]=min(dp[i][],dp[i-][]+a[i]);
                 if(j<=)
                     dp[i][j]=min(dp[i][j],dp[i-][j+]+b[i]);//加速
             }
         }
     /*    for(int i=0;i<=tot;++i)
             pr("%5d%c",i," \n"[i==tot]);
         for(int j=0;j<=10;++j)
         {
             for(int i=0;i<=tot;++i)
                 pr("%5d%c",dp[i][j]," \n"[i==tot]);
         }*/
         int ans=inf;
         for(int i=;i<=;++i)
             ans=min(ans,dp[tot][i]);
         pr("%d\n",ans);
     }
     return ;
 }

 /**************************************************************************************/

 int maxx(int a,int b)
 {
     return a>b?a:b;
 }

 void swapp(int &a,int &b)
 {
     a^=b^=a^=b;
 }

 int lowbit(int n)
 {
     return n&(-n);
 }

 int Del_bit_1(int n)
 {
     return n&(n-);
 }

 int abss(int a)
 {
     return a>?a:-a;
 }

 double fabss(double a)
 {
     return a>?a:-a;
 }

 int minn(int a,int b)
 {
     return a<b?a:b;
 }