poj 1018 贪心法

#include<iostream>
#include<math.h>
#include <iomanip>
using namespace std;
struct BP                   //设备
{
int price;
int brand;
int count;
};
int choosemin(int a, int b)
{
return a > b ? b : a;
}
double choosemax(double a, double b)
{
return a > b ? a:b;
}
int selectMIN(BP *s)//选出最小带宽
{
int min = 1000;
int sign = 0;
for (int i = 0; i < s[0].count; i++){
if (s[i].brand<min){
min = s[i].brand;
sign = i;
}
}
return sign;
}
int selectMAX(BP *s)//选出最大带宽
{
int max = 1;
int sign = 0;
for (int i = 0; i < s[0].count; i++){
if (s[i].brand>max){
max = s[i].brand;
sign = i;
}
}
return sign;
}
int choose(BP *s,int min)//选择最低的价格
{
int minprice = 100000;
int sign = 0;
for (int i = 0; i < s[0].count; i++){
if (s[i].price < minprice && s[i].brand>s[min].brand && s[i].price>0){
minprice = s[i].price;
sign = i;
}
}
return sign;
}
int main()
{
int num, sum, min, max;
int temp,index=0;
int minband=1000,sumprice=0;
double  maxbp[10], sign;
BP s[10][100];
cin >> num >> sum;//测试组数和设备数量
for (int k = 0; k < num; k++)
{
for (int i = 0; i < sum; i++) //输入每种设备的带宽和价格
{
cin >> s[i][0].count;
for (int j = 0; j < s[i][0].count; j++){
cin >> s[i][j].brand >> s[i][j].price;
}
}
minband = 1000;
sumprice = 0;
sign = 0;
temp = 0;
index = 0;
for (int i = 0; i < sum; i++){
max = selectMAX(s[i]);
min = selectMIN(s[i]);
maxbp[k] = (double)choosemin(s[i][min].brand, minband) / (sumprice + s[i][min].price);
//贪心法进行选择
for (int j = 0; j < s[i][0].count; j++){
temp = choose(s[i], min);
index = temp;
if (temp == max){
sign = maxbp[k];
maxbp[k] = choosemax(maxbp[k], (double)choosemin(minband, s[i][max].brand) / (sumprice + s[i][max].price));
if (maxbp[k]> sign){
index = temp;
}
break;
}
else
{
sign = maxbp[k];
maxbp[k] = choosemax(maxbp[k], (double)choosemin(minband, s[i][temp].brand) / (sumprice + s[i][temp].price));
s[i][temp].price = 0 - s[i][temp].price;
if (maxbp[k] > sign){
index = temp;
}
}
}
minband = choosemin(minband, s[i][index].brand);
sumprice += abs(s[i][index].price);
maxbp[k] = (double)choosemin(minband, s[i][index].brand) / sumprice;
}

}
for (int i = 0; i < num; i++)
{
cout << setiosflags(ios::fixed);
cout << setprecision(3);
cout << maxbp[i] << endl;
}
system("pause");
return 0;
}
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值