POJ 2385

 #include <algorithm>
 #include <cstdlib>
 #include <numeric>
 #include <iostream>
 using namespace std;

 int max(int i,int j)
 {
     if(i > j)
         return i;
     return j;
 }

 int main()
 {
     //freopen("acm.acm","r",stdin);
     int dp[][];
     int tree[];
     int T;
     int W;
     int i;
     int j;
     memset(dp,,sizeof(dp));
     cin>>T>>W;
     for(i = ;i <= T; ++ i)
         cin>>tree[i];
     for(i = ; i <= T; ++ i)
     {
         dp[i][] = dp[i-][];
         if(tree[i] == )
            ++ dp[i][];
     }
     for(i = ;i <= T;++ i)
     {
         for(j = ;j <= W;++ j)
         {
             if(j > i)
                 break;
             dp[i][j] = max(dp[i-][j],dp[i-][j-]);
             if(tree[i] == j%+)
                 ++ dp[i][j];
         }
     }
     cout<<dp[T][W];
     return ;
 }