nyoj 1242 Interference Signal 第八届河南省程序设计大赛

最新推荐文章于 2018-05-30 20:57:23 发布

原创最新推荐文章于 2018-05-30 20:57:23 发布 · 670 阅读

0 ·

CC 4.0 BY-SA版权

nyoj 专栏收录该内容

40 篇文章

订阅专栏

本文详细探讨了第八届河南省程序设计大赛中的一道题目——Interference Signal，分析了问题的核心概念及解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Interference Signal

时间限制： 2000 ms | 内存限制： 65535 KB

难度： 1

描述

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.

样例输入

10 6

5 2

样例输出

来源

第八届河南省程序设计大赛

#include<stdio.h>
int num[2005];
int main()
{
 int k,n,m;
 int i,j;
 long long sum;
 scanf("%d",&k);
 while(k--)
 {
  scanf("%d %d",&n,&m);
  for(i=0;i<n;i++)
  {
   scanf("%d",&num[i]);
  }
  int h=n-m+1;
     long long c,ave=-1;
  while(h--)
  {
   for(i=0;i<(n-m+1);i++)
   {
    sum=0;
    for(j=i;j<m+i;j++)
    {
     sum+=num[j];
    }
    //printf(" sum %lld\n",sum);
    c=sum*1000/(m*1.0);
    if(ave<c) ave=c; 
   }
   m+=1;
  }
 
   printf("%lld\n",ave);
 }
 return 0;
}