POJ 2184 Cow Exhibition
2018-06-17 21:19:16来源:未知 阅读 ()
POJ 2184 Cow Exhibition
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 6899 | Accepted: 2437 |
Description
fun..."
- Cows with Guns by Dana Lyons
The cows want to prove to the public that they are both smart and fun. In order to do this, Bessie has organized an exhibition that will be put on by the cows. She has given each of the N (1 <= N <= 100) cows a thorough interview and determined two values for each cow: the smartness Si (-1000 <= Si <= 1000) of the cow and the funness Fi (-1000 <= Fi <= 1000) of the cow.
Bessie must choose which cows she wants to bring to her exhibition. She believes that the total smartness TS of the group is the sum of the Si's and, likewise, the total funness TF of the group is the sum of the Fi's. Bessie wants to maximize the sum of TS and TF, but she also wants both of these values to be non-negative (since she must also show that the cows are well-rounded; a negative TS or TF would ruin this). Help Bessie maximize the sum of TS and TF without letting either of these values become negative.
Input
* Lines 2..N+1: Two space-separated integers Si and Fi, respectively the smartness and funness for each cow.
Output
Sample Input
5 -5 7 8 -6 6 -3 2 1 -8 -5
Sample Output
8
Hint
Bessie chooses cows 1, 3, and 4, giving values of TS = -5+6+2 = 3 and TF
= 7-3+1 = 5, so 3+5 = 8. Note that adding cow 2 would improve the value
of TS+TF to 10, but the new value of TF would be negative, so it is not
allowed.
Source
1 #include<cstdio> 2 #include<iostream> 3 #include<cstring> 4 #include<algorithm> 5 using namespace std; 6 const int inf=0x3f3f3f3f; 7 const int st=100000; //st必须大于等于100*1000 因为把负数全部容量转化为正数需要 100*1000 8 int dp[200007]; 9 int a[1009],b[1009]; 10 int main() 11 { 12 int p,n; 13 while(cin>>n) 14 { 15 for(int i=0;i<n;i++) 16 cin>>a[i]>>b[i]; 17 for(int i=0;i<=200007;i++) dp[i]= -inf; 18 dp[st]=0; 19 for(int i=0;i<n;i++) 20 { 21 if(a[i]<0&&b[i]<0) continue; 22 if(a[i]>0) 23 { 24 for(int j=200000;j>=a[i];j--) 25 { 26 if(dp[j-a[i]]>-inf) //inf为无限小避免当dp[j-a[i]==无限小时 dp[j]<dp[j-a[i]]+b[i] 27 dp[j]=max(dp[j],dp[j-a[i]]+b[i]); 28 } 29 30 } 31 else 32 { 33 for(int j=0;j<=a[i]+200000;j++) 34 { 35 if(dp[j-a[i]]>-inf) 36 dp[j]=max(dp[j],dp[j-a[i]]+b[i]); 37 } 38 39 } 40 41 } 42 int ans=0; 43 for(int i=100000;i<=200000;i++) 44 { 45 if(dp[i]>=0) ans=max(ans,dp[i]+i-100000); 46 } 47 cout<<ans<<endl; 48 49 } 50 51 return 0; 52 }
标签:
版权申明:本站文章部分自网络,如有侵权,请联系:west999com@outlook.com
特别注意:本站所有转载文章言论不代表本站观点,本站所提供的摄影照片,插画,设计作品,如需使用,请与原作者联系,版权归原作者所有
- POJ-3278 2020-04-01
- cow bowling 2020-02-13
- lost cows 2020-02-12
- Asteroids!_poj2225 2020-02-09
- Catch That Cow 2020-02-02
IDC资讯: 主机资讯 注册资讯 托管资讯 vps资讯 网站建设
网站运营: 建站经验 策划盈利 搜索优化 网站推广 免费资源
网络编程: Asp.Net编程 Asp编程 Php编程 Xml编程 Access Mssql Mysql 其它
服务器技术: Web服务器 Ftp服务器 Mail服务器 Dns服务器 安全防护
软件技巧: 其它软件 Word Excel Powerpoint Ghost Vista QQ空间 QQ FlashGet 迅雷
网页制作: FrontPages Dreamweaver Javascript css photoshop fireworks Flash