算法竞赛进阶指南,44页, 贪心, 高精度
本题要点:
1、 贪心:
按左右手的整数的乘积升序安排大臣;
2、 大数 bign 使用数组来存大数,涉及大数的乘法和除法:
a) 大数 乘以 普通的数 bign multi(bign a, int b);
b) 大数 除以 普通的数 bign divide(bign a, int b);
c) 大数在数组中的存储,数的低位存在数组的低位,大数的高位存在数组的高位;
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int n;
const int MaxN = 1010;
struct bign
{
int d[20010];
int len;
bign()
{
memset(d, 0, sizeof(d));
len = 0;
}
};
bign multi(bign a, int b)
{
bign c;
int carry = 0;
for(int i = 0; i < a.len; ++i)
{
int tmp = a.d[i] * b + carry;
c.d[c.len++] = tmp % 10;
carry = tmp / 10;
}
while(carry != 0)
{
c.d[c.len++] = carry % 10;
carry /= 10;
}
return c;
}
bign divide(bign a, int b)
{
bign c;
c.len = a.len;
int r = 0;
for(int i = a.len - 1; i >= 0; --i)
{
r = r * 10 + a.d[i];
if(r < b)
{
c.d[i] = 0;//不够除,补0
}else{
c.d[i] = r / b;
r = r % b;
}
}
//除去高位的0,同时保留一位最低位
while(c.len - 1 >= 1 && c.d[c.len - 1] == 0)
{
c.len--;
}
return c;
}
int cmp(bign a, bign b)
{
if(a.len > b.len) return 1;
else if(a.len < b.len) return -1;
else{
for(int i = a.len - 1; i >= 0; --i)
{
if(a.d[i] > b.d[i]) return 1;
else if(a.d[i] < b.d[i]) return -1;
}
return 0;
}
}
struct Person
{
int left;
int right;
bool operator<(const Person & rhs) const
{
return left * right < rhs.left * rhs.right;
}
}persons[MaxN];
int main()
{
scanf("%d", &n);
for(int i = 0; i <= n; ++i)
{
scanf("%d%d", &persons[i].left, &persons[i].right);
}
sort(persons + 1, persons + n + 1);
bign mul, ans, tmp;
mul.d[mul.len++] = 1;
ans.d[ans.len++] = 0;
for(int i = 0; i <= n; ++i)
{
if(i)
{
tmp = divide(mul, persons[i].right);
if(cmp(ans, tmp) == -1)
{
ans = tmp;
}
}
mul = multi(mul, persons[i].left);
}
for(int i = ans.len - 1; i >= 0; --i)
{
printf("%d", ans.d[i]);
}
printf("\n");
return 0;
}
/*
3
1 1
2 3
7 4
4 6
*/
/*
2
*/