usaco Chapter 3 section 3.1 Score Inflation
来源:互联网 发布:网络构建师 编辑:程序博客网 时间:2024/05/21 03:25
/*
ID: niepeng1
LANG: C++
TASK:inflate
此题堪称背包算法的绝题,解法的优化让人拍案叫绝
*/
/*
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.
*/
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#define Max1 10010
#define max2(a,b) a>b?a:b
using namespace std;
int num,total;
int main()
{
int p,m;
int way[Max1]={0};
FILE *in,*out;
int i,j,tem=0,ans=0;
in=fopen("inflate.in","r");
out=fopen("inflate.out","w");
fscanf(in,"%d %d",&total,&num);
for(i=0;i<num;i++){
fscanf(in,"%d %d",&p,&m);
for(j=0;j<=total;j++)
{
if(way[j+m] < way[j]+p)
way[j+m]=way[j]+p;
}
}
for(i=0;i<=total;i++)
if(ans<way[i])
ans=way[i];
fprintf(out,"%d/n",ans);
//cout<<ans<<endl;
fclose(in);
fclose(out);
return 0;
}
- usaco Chapter 3 section 3.1 Score Inflation
- USACO section 3.1 Score Inflation(DP背包)
- USACO Section 3.1 Score Inflation(完全背包)
- USACO-Section 3.1-PROB Score Inflation
- USACO-Section 3.1 Score Inflation(DP)
- USACO Section 3.1 Score Inflation - USACO的机器好强大~~
- 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--3.1Score Inflation+完全背包问题
- USACO 3.1 Score Inflation (完全背包)
- 1683 USACO 3.1 Score Inflation (完全背包)
- usaco Score Inflation
- usaco Score Inflation
- USACO:Score Inflation
- USACO-Score Inflation
- usaco Score Inflation
- ORA-02243: ALTER INDEX 或 ALTER MATERIALIZED VIEW 选项无效
- 李现路:在DSP6000中怎样编写您的第一个程序(1)
- java生成doc html
- MySQL最多能装多少记录
- Opencv之PCA篇
- usaco Chapter 3 section 3.1 Score Inflation
- 个人职业提升需要跨越性思维
- 短信 男人女人
- 无线接入点(AP)
- 重要度和优先度引发的思考
- November 25th Wednesday
- Windows如何区分鼠标双击和两次单击
- updatepanel中动态生成组件及绑定事件问题的解决
- 智能卡(Smart Card)服务修复工具(解决无法读取外接设备的问题)