Aizu 2305

寒假训练一：B题

传送门：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=105080#problem/B

B - Beautiful Currency

Time Limit:5000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu

Description

KM country has N kinds of coins and each coin has its value a_i.

The king of the country, Kita_masa, thought that the current currency system is poor, and he decided to make it beautiful by changing the values of some (possibly no) coins.

A currency system is called beautiful if each coin has an integer value and the (i+1)-th smallest value is divisible by the i-th smallest value for all i (1 \leq i \leq N-1).

For example, the set {1, 5, 10, 50, 100, 500} is considered as a beautiful system, while the set {1, 5, 10, 25, 50, 100} is NOT, because 25is not divisible by 10.

Since changing the currency system may confuse citizens, the king, Kita_masa, wants to minimize the maximum value of the confusion ratios. Here, the confusion ratio for the change in the i-th coin is defined as |a_i - b_i| / a_i, where a_i and b_i is the value of i-th coin before and after the structure changes, respectively.

Note that Kita_masa can change the value of each existing coin, but he cannot introduce new coins nor eliminate existing coins. After the modification, the values of two or more coins may coincide.

Input

Each dataset contains two lines. The first line contains a single integer, N, and the second line contains N integers, {a_i}.

You may assume the following constraints:

1 \leq N \leq 20

1 \leq a_1 \lt a_2 \lt... \lt a_N \lt 10^5

Output

Output one number that represents the minimum of the maximum value of the confusion ratios. The value may be printed with an arbitrary number of decimal digits, but may not contain an absolute error greater than or equal to 10^{-8}.

Sample Input 1

3
6 11 12

Output for the Sample Input 1

0.090909090909

Sample Input 2

3
6 11 24

Output for the Sample Input 2

0.090909090909

Sample Input 3

3
6 11 30

Output for the Sample Input 3

0.166666666667

题意：给出n个数，改变其中一些数使得除第一个外每一个数是前一个的倍数。

所更改的代价即为|ai-bi|/ai，ai为原来的数，求更改到所需数列代价最大值的最小值。

DP题，dp[i][j]表示以j结尾长度为i的代价最小值

结尾的数必然小于2倍a[i]中的最大值，不然代价大于1，不如把所有数都变成1来的优

对于任意一个dp[i][k]过一遍一遍所有dp[i-1][k的因子]即可

记得比赛那天看完题目直接弃疗滚去洗澡...

回来看题解才知道这种题目都能dp也是厉害的...

然后才知道根本不止dp这一种方法

可以百度一下

下面代码

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
using namespace std;

double dp[30][100005];

int main()
{
	int n,i,j,k,l;
	double dmax,ans;
	int a[30];
	
	scanf("%d",&n);
	for(i=1;i<=n;i++)
		scanf("%d",&a[i]);
	k=a[n]*2-1;
	for(i=1;i<=n;i++)
		for(j=1;j<=k;j++)
			dp[i][j]=999999999;
	for(i=1;i<=k;i++)
		dp[1][i]=fabs(a[1]-i)/a[1];
	for(i=2;i<=n;i++)
		for(j=1;j<=k;j++)
			for(l=j;l<=k;l=l+j)
			{
				ans=fabs(a[i]-l)/a[i];
				if(ans<dp[i-1][j]) ans=dp[i-1][j];
				if(ans<dp[i][l]) dp[i][l]=ans;
			}
	dmax=999999999;
	for(i=1;i<=k;i++)
		if(dp[n][i]<dmax) dmax=dp[n][i];
	printf("%.12lf\n",dmax);
			
}