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 : Two space-separated integers, N and M.
 * Lines2~line N+: ai (i=,,…,N)
  ≤ K≤ ,  ≤ N≤ ,  ≤ M ≤ N,  ≤ ai ≤
 输出
 For each test case generate a single line containing a single integer that is  times the maximal average value. Do not perform rounding.
 样例输入

 样例输出

 来源
 NYOJ

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

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