1246. 等差数列
思路
题意:知道若干项等差数列,求最短的等差数列项数即可行性最大公差 要使得 a n − a 1 d + 1 \frac{a_{n} - a_{1}}{d} + 1 dan−a1+1即 a n a_{n} an为最大项, a 1 a_{1} a1为最小项,d为各项之间得最大公约数
样例输入:
5
2 6 4 10 20
样例输出:
10
代码O(nlogn):
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 100000;
int n;
int a[N];
//欧几里得求最大公约数
int gcd(int a, int b)
{
return b ? gcd(b, a % b) : a;
}
int main()
{
cin >> n;
for(int i = 1; i <= n; i ++ )
cin >> a[i];
// A1∼AN 并不一定是按等差数列中的顺序给出 -> 排序
sort(a + 1, a + n + 1);
//求公差的最大公约数开始check
int d = 0;
int t = a[n] - a[1];
for(int i = 1; i < n; i ++ )
d = gcd(d, a[i + 1] - a[i]);
int res;
//如果公差为0 即该等差数列的最小个数为n
if(!d) res = n;
else res = t / d + 1;
cout << res << endl;
return 0;
}
1223. 最大比例
最大比例
思路:
原数列为: a 1 , a 2 ∗ ( p q ) 1 , a 2 ∗ ( p q ) 2 , . . . , a 2 ∗ ( p q ) n a_{1},a_{2} * (\frac{p}{q})^1,a_{2} * (\frac{p}{q})^2,...,a_{2} * (\frac{p}{q})^n a1,a2∗(qp)1,a2∗(qp)2,...,a2∗(qp)n
抽取若干数列: b 0 , b 1 , . . . , b ( N − 1 ) b_{0},b_{1},...,b_{(N-1)} b0,b1,...,b(N−1)
每一项都除以 b 0 b_{0} b0可得 b 1 b 0 , b 2 b 0 , . . . , b ( N − 1 ) b 0 \frac{b_{1}}{b_{0}},\frac{b_{2}}{b_{0}},...,\frac{b_{(N-1)}}{b_{0}} b0b1,b0b2,...,b0b(N−1)
用原数列代替即为: ( p q ) x 1 , ( p q ) x 2 , . . . , ( p q ) N − 1 (\frac{p}{q})^{x1},(\frac{p}{q})^{x2},...,(\frac{p}{q})^{N - 1} (qp)x1,(qp)x2,...,(qp)N−1 我们需要求得是 ( p q ) k (\frac{p}{q})^{k} (qp)k使得k最大即求 x 1 , x 2 , . . . , x N − 1 x_{1},x_{2},...,x_{N - 1} x1,x2,...,xN−1的最大公约数->用辗转相减法(更相减损数)
样例输入:
3
549755813888 524288 2
样例输出:
4/1
代码:
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 105;
typedef long long LL;
LL x[N], up[N], down[N];
LL gcd(LL a, LL b)
{
return b ? gcd(b, a % b) : a;
}
//辗转相减法
LL getsub(LL a, LL b)
{
if(a < b) swap(a, b);
if(b == 1) return a;
return getsub(b, a / b);
}
int main()
{
int n;
cin >> n;
for(int i = 0; i < n; i ++ ) cin >> x[i];
sort(x, x + n);
//去重
LL m = 0;
for(int i = 0; i < n; i ++ )
{
LL d = gcd(x[0], x[i]);
if(x[i] == x[i + 1]) continue;
//约分
up[m] = x[i] / d;
down[m ++ ] = x[0] / d;
}
LL a = up[0], b = down[0];
for(int i = 1; i < m; i ++ )
{
a = getsub(a, up[i]);
b = getsub(b, down[i]);
}
cout << a << "/" << b << endl;
return 0;
}