Uva1025 A Spy in the Metro

#include <iostream>
#include <cstring>
#include <cstdio>

using namespace std;

int t[];
int dp[][];                 //dp[i][j]记录在第i个车站需要等待时间
int l[][], r[][];      //l[i][j]第i个车站在j时刻是否有从左边行驶的车辆  r[i][j]右方向同l[i][j]
int num = ;
int min(int a,int b){
    if(a<b) return a;
    return b;
}
int main()
{
    int n,T,m,cur;
    while (scanf("%d",&n)!=EOF )
    {
        memset(l, , sizeof(l));
        memset(r, , sizeof(r));
        memset(dp, 0x3f, sizeof(dp));
        cin>>T;
        for(int i=;i<n;i++)    cin>>t[i];
        cin>>m;
        for(int i=;i<=m;i++)
        {
            cin>>cur;
            for(int j=;j<=n;j++)
            {
                l[j][cur] = , cur += t[j];
            }
        }
        cin>>m;
        for(int i=;i<=m;i++)
        {
            cin>>cur;
            for(int j=n;j>;j--)
            {
                r[j][cur] = , cur += t[j - ];
            }
        }
        dp[n][T]=;
        for(int j=T-;j>=;j--)
            for(int i=;i<=n;i++)
            {
                dp[i][j]=dp[i][j+]+;
                if(l[i][j]) dp[i][j] = min(dp[i][j],dp[i+][j+t[i]]);
                if(r[i][j]) dp[i][j] = min(dp[i][j],dp[i-][j+t[i-]]);
            }
        cout<< "Case Number "<<++num<<": ";
        if(dp[][]>T)
            cout<<"impossible"<<endl;
        else
            cout<<dp[][]<<endl;
    }
    return ;
}