Aizu2130-Billion Million Thousand-dp

用dp求出最大的表达，再用dp求出。//然而并没有想出来

 #include <cstdio>
 #include <string>
 #include <algorithm>
 #include <iostream>

 using namespace std;

 const int INF = 0x3f3f3f3f;
 const int maxn = ;

 int N,v[maxn],len[maxn];
 int dp[maxn];

 string s[maxn],str;

 int main()
 {
     int cas = ;
     while(cin >> N && N)
     {
         for(int i=;i<N;i++)
         {
             cin >> s[i] >> v[i];
             len[i] = s[i].length();
         }
         cin >> str;
         int length = str.length();

         for(int i=;i<=length;i++) dp[i] = -INF;
         dp[] = ;

         for(int i=;i<=length;i++)
         {
             for(int j=;j<N;j++)
             {
                 int End = i - len[j];
                 if(End>= && dp[End]>= && str.substr(End,len[j]) == s[j])
                     {dp[i] = max(dp[i],dp[End]+v[j]);}
             }
         }

         int mx = dp[length];

         for(int i=;i<=mx;i++) dp[i] = INF;
         dp[] = ;

         for(int i=;i<N;i++)
         {
             for(int j=;j<=mx-v[i];j++)
                 dp[j+v[i]] = min(dp[j+v[i]] , dp[j]+len[i]);
         }
         cout << "Case "<<cas++<< ": " << dp[mx] << endl;
     }
 }