NYOJ 1242 Interference Signal

Interference Signal

 

 

描述

Dr.Kong’s laboratory monitor some interference signals. The interference signals can be digitized into a series of positive integer. May be, there are N integers a1,a2,…,an.

 

Dr.Kong wants to know the average strength of a contiguous interference signal block. the block must contain at least M integers.

 

Please help Dr.Kong to calculate the maximum average strength, given the constraint.

 

输入

The input contains K test cases. Each test case specifies:
* Line 1: Two space-separated integers, N and M.
* Lines2~line N+1: ai (i=1,2,…,N)
1 ≤ K≤ 8, 5 ≤ N≤ 2000, 1 ≤ M ≤ N, 0 ≤ ai ≤9999

输出

For each test case generate a single line containing a single integer that is 1000 times the maximal average value. Do not perform rounding.

样例输入

2 
10 6
6 
4
2
10
3
8
5
9
4
1
5 2
10
3
8
5 
9 

样例输出

6500
7333

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int a[2005];

int main()
{
    int k,n,m;
    scanf("%d",&k);
    while(k--)
    {
        scanf("%d%d",&n,&m);
        double aver=0.0;
        memset(a,0,sizeof(a));
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            a[i]+=a[i-1];
        }
        for(int i=1;i<=n;i++)
            for(int j=i+m-1;j<=n;j++)
            {
                double tmp=(a[j]-a[i-1])*1.0/(j-i+1);
                aver=max(aver,tmp);
            }
        int ans=(int)(aver*1000);
        printf("%d\n",ans);
    }
    return 0;
}