POJ 1015

 #include<iostream>
 #include<algorithm>
 #define MAXN 201
 #define count C_ount
 using namespace std;

 int _m[][];
 int count[][];
 int a[];

 struct _node
 {
     int first;
     int second;
 };

 _node _cand[MAXN];
 int n;
 int main()
 {
     //freopen("acm.acm","r",stdin);
     int m;
     int i;
     int j;
     int time;
     int max;
     int u;
     int v;
     int u_v;
     int _i;
     int _j;
     int _test_time = ;
     int index;
     int ans;
     while(cin>>n>>m,n||m)
     {
         memset(count,-,sizeof(count));
         memset(_m,-,sizeof(_m));
         max = m*;
         for(i = ; i < n; ++ i)
         {
             cin>>u>>v;
             _cand[i].first = u - v;
             _cand[i].second = u + v;
         }
         for(i = ; i < n; ++ i)
         {
             if(count[][max+_cand[i].first] < _cand[i].second)
             {
                 _m[][max+_cand[i].first] = i;
                 count[][max+_cand[i].first] = _cand[i].second;
             }
         }
         for(time = ; time < m-; ++ time)
         {
             for(u_v = ; u_v <= max*; ++ u_v)
             {
                 if(_m[time][u_v] != -)
                 {
                     for(i = ; i < n; ++ i)
                     {
                         if(count[time+][u_v + _cand[i].first] < count[time][u_v] + _cand[i].second)
                         {
                             _j = u_v;
                             for(_i = time; _i >= ; -- _i)
                             {
                                 if(_m[_i][_j] == i)
                                     break;
                                 _j -= _cand[_m[_i][_j]].first;
                             }
                             if(_i < )
                             {
                                 _m[time+][u_v+_cand[i].first] = i;
                                 count[time+][u_v+_cand[i].first] = count[time][u_v] + _cand[i].second;
                             }
                         }
                     }
                 }
             }
         }

         /////////////

         for(i = ; i <= max; ++ i)
         {
             int tem_1 = count[m-][max+i];
             int tem_2 = count[m-][max-i];
             if( (tem_1 = count[m-][max+i]) >=  || (tem_2 = count[m-][max-i]) >= )
             {
                 if(tem_1 > tem_2)
                 {
                     ans = max+i;
                 }
                 else
                 {
                     ans = max-i;
                 }
                 break;
             }
         }
         cout<<"Jury #"<<++ _test_time<<endl;
         cout<<"Best jury has value "<<(count[m-][ans] + (ans - max))/<<" for prosecution and value "<<(count[m-][ans] - (ans - max))/<<" for defence:"<<endl;
         j = ans;
         index = ;
         for(i = m-; i >= ; -- i)
         {
             a[index ++] = _m[i][j];
             j -= _cand[_m[i][j]].first;
         }
         sort(a,a+index);
         for(i = ; i < index; ++ i)
         {
             cout<<" "<<a[i]+;
         }
         cout<<endl;
         cout<<endl;
     }
 }

关注我的公众号，当然，如果你对Java, Scala, Python等技术经验，以及编程日记，感兴趣的话。

技术网站地址： vmfor.com