Description
FJ wants to build a fence around a contiguous group of these fields in order to maximize the average number of cows per field within that block. The block must contain at least F (1 <= F <= N) fields, where F given as input.
Calculate the fence placement that maximizes the average, given the constraint.
Input
* Lines 2..N+1: Each line contains a single integer, the number of cows in a field. Line 2 gives the number of cows in field 1,line 3 gives the number in field 2, and so on.
Output
Sample Input
10 6 6 4 2 10 3 8 5 9 4 1
Sample Output
6500
關於這個動規思想主要是用二分去尋找恰當的值
然後求在某一段上的滿足條件的段
用dp的式子就是s[m]=max(s[m-1]+a[i],s[i]-s[i-m]);
舉個例子來說,有一串數:1 2 3 4 5 6 7 8
假設長度至少需要3,那麼就是s[3]就是6,這個是可以確定的
然後下一個我們的長度如果需要正好是3,那麼可能的取值就是
{(1 2 3) ,(2 ,3 ,4), (3,4,5)...(6,7,8));
但是如果是大於3呢?
假設可能的長度爲4或3
那麼當前的子問題是(1,2,3,4)和(2,3,4)的那個平均數大的問題
由上遞推可得,最後的一定爲最優解