poj3211Washing Clothes(字符串处理+01背包) hdu1171Big Event in HDU(01背包)
题目链接:
这个题目比1711难处理的是字符串怎样处理,所以我们要想办法,自然而然就要想到用结构体存储。所以最后将全部的衣服分组,然后将每组时间减半,看最多能装多少。最后求最大值。那么就非常愉快的转化成了一个01背包问题了。。。。
hdu1711是说两个得到的价值要尽可能的相等。所以还是把全部的价值分为两半。最后01背包,那么这个问题就得到了解决。。
题目:
Time Limit: 1000MS | Memory Limit: 131072K | |
Total Submissions: 8637 | Accepted: 2718 |
Description
Dearboy was so busy recently that now he has piles of clothes to wash. Luckily, he has a beautiful and hard-working girlfriend to help him. The clothes are in varieties of colors but each piece of them can be seen as of only one color. In order to prevent the clothes from getting dyed in mixed colors, Dearboy and his girlfriend have to finish washing all clothes of one color before going on to those of another color.
From experience Dearboy knows how long each piece of clothes takes one person to wash. Each piece will be washed by either Dearboy or his girlfriend but not both of them. The couple can wash two pieces simultaneously. What is the shortest possible time they need to finish the job?
Input
The input contains several test cases. Each test case begins with a line of two positive integers M and N (M < 10, N < 100), which are the numbers of colors and of clothes. The next line contains Mstrings which are not longer than 10 characters and do not contain spaces, which the names of the colors. Then follow N lines describing the clothes. Each of these lines contains the time to wash some piece of the clothes (less than 1,000) and its color. Two zeroes follow the last test case.
Output
For each test case output on a separate line the time the couple needs for washing.
Sample Input
3 4 red blue yellow 2 red 3 blue 4 blue 6 red 0 0
Sample Output
10
Source
代码为:
#include<cstdio>
#include<map>
#include<iostream>
#include<cstring>
using namespace std;
const int maxn=100000+10;
int dp[maxn];
struct clothes
{
int num;//颜色同样的衣服的编号
int sum;//颜色形同的衣服的总数
char color[100];//颜色
int time[105];//颜色同样的不同衣服的时间
}clo[10+10];
int main()
{
int m,n,u,max_pack,ans;
char str[100+10];
while(~scanf("%d%d",&m,&n))
{
if(n==0&&m==0) return 0;
for(int i=1;i<=m;i++)
{
scanf("%s",clo[i].color);
clo[i].num=1;
clo[i].sum=0;
}
for(int i=1;i<=n;i++)
{
scanf("%d%s",&u,str);
for(int j=1;j<=m;j++)
{
if(strcmp(str,clo[j].color)==0)
{
int tmp=clo[j].num;
clo[j].time[tmp]=u;
clo[j].sum=clo[j].sum+u;
clo[j].num++;
}
}
}
for(int i=1;i<=m;i++)
clo[i].num--;
ans=0;
for(int i=1;i<=m;i++)
{
memset(dp,0,sizeof(dp));
max_pack=clo[i].sum/2;
for(int j=1;j<=clo[i].num;j++)
for(int k=max_pack;k>=clo[i].time[j];k--)
dp[k]=max(dp[k],dp[k-clo[i].time[j]]+clo[i].time[j]);
ans=ans+max(dp[max_pack],clo[i].sum-dp[max_pack]);
}
cout<<ans<<endl;
}
return 0;
}
hdu1171 题目:
Big Event in HDU
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23302 Accepted Submission(s): 8206
The splitting is absolutely a big event in HDU! At the same time, it is a trouble thing too. All facilities must go halves. First, all facilities are assessed, and two facilities are thought to be same if they have the same value. It is assumed that there is N (0<N<1000) kinds of facilities (different value, different kinds).
A test case starting with a negative integer terminates input and this test case is not to be processed.
2 10 1 20 1 3 10 1 20 2 30 1 -1
20 10 40 40
代码为
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=250000+10;
int dp[maxn];
int sum[50+10],val[50+10];
int kind[5000+10];
int main()
{
int n,max_pack,ans,cal,Max;
while(~scanf("%d",&n))
{
memset(dp,0,sizeof(dp));
if(n<=0) return 0;
cal=1;
max_pack=0;
for(int i=1;i<=n;i++)
{
scanf("%d%d",&val[i],&sum[i]);
max_pack+=sum[i]*val[i];
for(int j=1;j<=sum[i];j++)
{
kind[cal]=val[i];
cal++;
}
}
cal--;
Max=max_pack/2;
for(int i=1;i<=cal;i++)
for(int j=Max;j>=kind[i];j--)
dp[j]=max(dp[j],dp[j-kind[i]]+kind[i]);
ans=max(dp[Max],max_pack-dp[Max]);
cout<<ans<<" "<<max_pack-ans<<endl;
}
return 0;
}
相关文章
- arp攻击的处理方法
- Word控件Spire.Doc 【段落处理】教程(九):在 C# 中将 HTML 字符串代码附加到 .doc 时设置文本对齐方式
- Word处理控件Aspose.Words功能演示:使用 Java 拆分 MS Word 文档
- laravel 处理图片
- HDU 2206 IP的计算(字符串处理)
- 14.parfor并行循环处理
- Guava基本工具包Base:Null和字符串分割(Splitter)、拼接(Joiner)处理
- [Google Guava] 6-字符串处理:分割,连接,填充
- bash中的字符串处理
- 执行./script/checkpatch.pl my.patch来检查补丁时报错"perl: warning: Setting locale failed. perl: warning: Please check that your locale settings: LANGUAGE = (unset), LC_ALL=(unset),"如何处理?
- 【Python】数据入库出库处理/list列表/数组/转字符串
- Python 字符串处理(转)
- linux下用sox音频处理常用方法
- ZOJ1217 Numerically Speaking (进制转换,大整数除法,字符串处理,较难而且坑)
- Springboot Session集群处理
- 拦截RESTful API并做相应处理的方式
- 《Clojure数据分析秘笈》——2.8节大数据集的延迟处理
- 使你的C/C++代码支持Unicode(CRT字符串处理的所有API列表,甚至有WEOF字符存在)
- 《深入解析sas:数据处理、分析优化与商业应用》一2.5 SAS程序错误及处理
- php异步处理
- C++ LinuxWebServer项目(2)如何处理请求
- RAC环境TNS-12541报错处理
- ASP.NET mvc4 WEB API异常处理
- 【正点原子Linux连载】第六章 字符串处理-摘自【正点原子】I.MX6U嵌入式Linux C应用编程指南V1.1
- python 中药归经整理,字符串处理
- 字符、字符串和文本的处理之String类型