题目链接
http://codeforces.com/contest/1133/problem/D
题意
给两个数组 a a a和 b b b组成一个新的数组 c c c,其中对于 c i : = d ⋅ a i + b i ci:=d⋅ai+bi ci:=d⋅ai+bi,求 d d d使得数组 c c c中零的个数最多。
思路
- 如果 a i = 0 ai = 0 ai=0,则 c i = b i ci = bi ci=bi,那么如果 b i = 0 bi = 0 bi=0,答案就加一。(这点很容易被忽略)
- 否则 d = − b i / a i d = -bi / ai d=−bi/ai,可以把这个分数记录在map里,最后找哪个数出现次数最多。
- 由于浮点数精度不够,可以将分子分母约分后变成pair再存入map。
AC代码
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<string>
#include<sstream>
#include<cctype>
#include<map>
#include<stack>
#include<queue>
#include<list>
#include<cstdlib>
#include<ctime>
using namespace std;
typedef long long ll;
const double PI = atan(1.0)*4;
const int INF = 0x7ffffff;
const ll MOD = 1000000007;
const int maxn = 200010;
int gcd(int a, int b){return b==0?a:gcd(b,a%b);}
int a[maxn], b[maxn];
map<pair<int, int>, int> M;
int main()
{
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n, m = 0, cnt = 0, x, y, g;
scanf("%d", &n);
for(int i = 0; i < n; i++)
scanf("%d", &a[i]);
for(int i = 0; i < n; i++)
{
scanf("%d", &b[i]);
if(a[i] == 0)
{
if(b[i] == 0)
cnt++;
continue;
}
g = gcd(a[i], b[i]);
x = a[i] / g;
y = b[i] / g;
if(M[make_pair(x, y)] == 0)
M[make_pair(x, y)] = 1;
else
M[make_pair(x, y)]++;
}
map<pair<int, int>, int>::iterator it;
for(it = M.begin(); it != M.end(); it++)
{
if(it->second > m)
m = it->second;
}
printf("%d\n", m + cnt);
return 0;
}