ICPC 2015 · Problem A · Amalgamated Artichokes

39th ICPC · Marrakesh, Morocco

Statement

Time limit: 5 seconds

Picture by Hans Hillewaert via Wikimedia Commons Fatima Cynara is an analyst at Amalgamated Artichokes (AA). As with any company, AA has had some very good times as well as some bad ones. Fatima does trending analysis of the stock prices for AA, and she wants to deter- mine the largest decline in stock prices over various time spans. For example, if over a span of time the stock prices were 1919, 1212, 1313, 1111, 2020 and 1414, then the largest decline would be 88 between the first and fourth price. If the last price had been 1010 instead of 1414, then the largest decline would have been 1010 between the last two prices.

Fatima has done some previous analyses and has found that the stock price over any period of time can be mod- elled reasonably accurately with the following equation:

price(k)=p(sin(ak+b)+cos(ck+d)+2)price(k) =p\cdot (sin(a\cdot k+b) + cos(c\cdot k+d) + 2)

where pp, aa, bb, cc and dd are constants. Fatima would like you to write a program to determine the largest price decline over a given sequence of prices. Figure A.1 illustrates the price function for Sample Input 1. You have to consider the prices only for integer values of kk.

Figure A.1: Sample Input 1. The largest decline occurs from the fourth to the seventh price.

Figure A.1: Sample Input 1. The largest decline occurs from the fourth to the seventh price.

Input

The input consists of a single line containing 66 integers pp (1p10001 \le p \le 1 000), aa, bb, cc, dd (0a,b,c,d0 \le a, b, c, d \le 10001 000) and nn (1n1061 \le n \le 10^{6}). The first 55 integers are described above. The sequence of stock prices to consider is price(1),price(2),...,price(n)price(1),price(2), . . . ,price(n).

ACM-ICPC World Finals 2015 Problem A: Amalgamated Artichokes

Output

Display the maximum decline in the stock prices. If there is no decline, display the number 00. Your output should have an absolute or relative error of at most 10610^{- 6}.

Sample Input 1

42 1 23 4 8 10

Sample Output 1

104.855110477

Sample Input 2

100 7 615 998 801 3

Sample Output 2

0.00

Sample Input 3

100 432 406 867 60 1000

Sample Output 3

399.303813

ACM-ICPC World Finals 2015 Problem A: Amalgamated Artichokes

No official solution in the source collection.