InterferenceSignal-----------挺简单的 一道题 就是英语不好

InterferenceSignal
时间限制: 2000ms内存限制: 128000KB 64位整型:      Java 类名:
上一题  提交  运行结果  统计   讨论版  下一题
类型: 
没有

   添加
题目描述
Dr.Kong’s laboratory monitorsome interference signals. The interference signals can be digitized into aseries of positive integer. May be, there are N integers a1,a2,…,an.

 

Dr.Kong wants toknow the averagestrength of a contiguous interference signal block. the block mustcontain at least M integers.

 

Pleasehelp Dr.Kong tocalculate the maximumaverage strength, giventhe 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
来源
NYOJ

第一行 两个数字   第一个数字代表 有多少个 数字信号   第二个代表  最少需要 几个 连续的信号  求其平均值 . 

#include <stdio.h>
#include <string.h>
int main()
{
    int ncase,a[2005];
    scanf("%d",&ncase);
    while(ncase--)
    {
        int n,m;
        double sum,max=-0x3fffffff;
        memset(a,0,sizeof(a));
        scanf("%d %d",&n,&m);
        for(int i=0;i<n;i++)
        scanf("%d",&a[i]);
        for(int i=0;i+m<=n;i++)
        {
            for(int k=m;k<=n&&i+k<=n;k++)
            {
                sum=0;
                for(int j=0;j<k;j++)
                    sum+=a[i+j];
                if(sum/k>max)
                max=sum/k;
            }
        }
        printf("%d
",(int)(max*1000));
    }
    return 0;
}