ZOJ-2091 Mean of Subsequence

 Given N numbers in a line, we can determine a continuous subsequence by giving its start position and its length.

PMH and Roy played a game the other day. Roy gives the start position first, then PMH gives the length. Roy wants the mean of the subsequence as large as possible, while PMH wants it as small as possible.

You are to calculate the best result Roy can get, assuming PMH is very clever.

Input

There are multiple testcases.

Each testcase begins with a line containing N only.

The following line contains N numbers, separated by spaces.

Output

For each testcase, you are to print the best mean of subsequece Roy can get, precise to 6 digit after decimal point.

Sample Input

10
2 10 4 6 5 10 10 2 3 2

Sample Output

5.777778

#include <stdio.h> #define MAXNUM 10000 int main() { int n; int t,sum,i; int num[MAXNUM]; double max,ave; // freopen("d://input.txt","r",stdin); while (scanf("%d",&n)!=EOF) { sum=0; for (i=0;i<n;i++) { scanf("%d",&num[i]); sum+=num[i]; } max=sum*1.0/n; t=n-1; for (i=0;i<n-1;i++) { sum-=num[i]; ave=sum*1.0/t--; if (ave>max) max=ave; } printf("%.6f/n",max); } return 0; }