USACO 3.1 Score Inflation
来源:互联网 发布:杭州电视台网络直播 编辑:程序博客网 时间:2024/05/21 09:33
The more points students score in our contests, the happier we here at the USACO are. We try to design our contests so that people can score as many points as possible, and would like your assistance.
We have several categories from which problems can be chosen, where a "category" is an unlimited set of contest problems which all require the same amount of time to solve and deserve the same number of points for a correct solution. Your task is write a program which tells the USACO staff how many problems from each category to include in a contest so as to maximize the total number of points in the chosen problems while keeping the total solution time within the length of the contest.
The input includes the length of the contest, M (1 <= M <= 10,000) (don't worry, you won't have to compete in the longer contests until training camp) and N, the number of problem categories, where 1 <= N <= 10,000.
Each of the subsequent N lines contains two integers describing a category: the first integer tells the number of points a problem from that category is worth (1 <= points <= 10000); the second tells the number of minutes a problem from that category takes to solve (1 <= minutes <= 10000).
Your program should determine the number of problems we should take from each category to make the highest-scoring contest solvable within the length of the contest. Remember, the number from any category can be any nonnegative integer (0, one, or many). Calculate the maximum number of possible points.
PROGRAM NAME: inflate
INPUT FORMAT
Line 1: | M, N -- contest minutes and number of problem classes |
Lines 2-N+1: | Two integers: the points and minutes for each class |
SAMPLE INPUT (file inflate.in)
300 4100 60250 120120 10035 20
OUTPUT FORMAT
A single line with the maximum number of points possible given the constraints.SAMPLE OUTPUT (file inflate.out)
605 完全背包问题,代码如下:
- int m,n,v[10001];
- int main()
- {
- int a,b;
- freopen("inflate.in","r",stdin);
- freopen("inflate.out","w",stdout);
- scanf("%d%d",&m,&n);
- for(int i=0;i<=m;++i) v[i]=0;
- while (n--)
- {
- scanf("%d%d",&a,&b);
- for (int i=b;i<=m;++i) v[i]=max(v[i],v[i-b]+a);
- }
- printf("%d/n",v[m]);
- return 0;
- }
- USACO 3.1 Score Inflation
- USACO 3.1.2 Score Inflation
- USACO 3.1 Score Inflation (inflate)
- USACO 3.1 Score Inflation (完全背包) P2722 总分 Score Inflation
- usaco Chapter 3 section 3.1 Score Inflation
- USACO section 3.1 Score Inflation(DP背包)
- USACO--3.1Score Inflation+完全背包问题
- USACO 3.1 Score Inflation (完全背包)
- USACO Section 3.1 Score Inflation(完全背包)
- USACO-Section 3.1-PROB Score Inflation
- USACO-Section 3.1 Score Inflation(DP)
- 1683 USACO 3.1 Score Inflation (完全背包)
- usaco Score Inflation
- usaco Score Inflation
- USACO:Score Inflation
- USACO-Score Inflation
- usaco Score Inflation
- USACO Score Inflation 总分
- 宁愿和聪明的人吵架,也不愿和愚笨的人说话!
- 29 个漂亮至极的 Blogger 模板下载
- 公司可以上CSDN!!!
- 解决vs2005的web项目转换成vs2008后出现的一些小问题
- 未来的目标 前进
- USACO 3.1 Score Inflation
- 加密网站配置文件中的信息
- 使用 Visual Studio 2005 对私有方法的单元测试
- 开发Java系统程序员要注意的基本知识
- WIN sever 2003+双网卡+路由器,可以做的更安全
- Web 下配置文件信息的读写
- .net 2.0 中对配置文件的读写
- My97 使用的一点技巧
- 一些网站、论坛、工具