USACO Section 3.1: Score Inflation

完全背包问题

 /*
 ID: yingzho1
 LANG: C++
 TASK: inflate
 */
 #include <iostream>
 #include <fstream>
 #include <string>
 #include <map>
 #include <vector>
 #include <set>
 #include <algorithm>
 #include <stdio.h>
 #include <queue>
 #include <cstring>
 #include <cmath>
 #include <list>

 using namespace std;

 ifstream fin("inflate.in");
 ofstream fout("inflate.out");

 ;

 struct cat {
     int point;
     int time;
     cat(int a, int b) : point(a), time(b) { }
     cat() : point(), time() { }
 };

 int total_time;
 int N;

 int main()
 {
     fin >> total_time >> N;
     vector<cat> pro(N);
     ; i < N; i++) {
         fin >> pro[i].point >> pro[i].time;
     }
     vector<);
     ; i < N; i++) {
         ; j*pro[i].time < total_time; j++) {
             ; j*pro[i].time+k <= total_time && k <= pro[i].time; k++) {
                 /*if (f[j*pro[i].time+k] < f[(j-1)*pro[i].time+k]+pro[i].point) {
                     f[j*pro[i].time+k] = f[(j-1)*pro[i].time+k]+pro[i].point;
                     cout << "f[" << j*pro[i].time+k << "]: " << f[j*pro[i].time+k] << endl;
                 }*/
                 f[j*pro[i].time+k] = max(f[j*pro[i].time+k], f[(j-)*pro[i].time+k]+pro[i].point);
                 //cout << "f[" << j*pro[i].time+k << "]: " << f[j*pro[i].time+k] << endl;
             }
         }
     }
     fout << f[total_time] << endl;

     ;
 }