Interference Signal 第八届

最新推荐文章于 2021-03-18 11:27:57 发布

My_Fresh_Start

最新推荐文章于 2021-03-18 11:27:57 发布

阅读量515

点赞数 1

分类专栏：往届省赛题

本文链接：https://blog.csdn.net/Xwxcy/article/details/51347314

版权

往届省赛题专栏收录该内容

10 篇文章 0 订阅

订阅专栏

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.

样例输入

2 10 6

6 4210385941

5 2

10385 9

样例输出

来源

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

AC代码：

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{
    int M,N,K;
	int a[2010];
	int i,j,k;
	double sum,s;
    while(cin>>K)
    while(K--){
        cin>>N>>M;
        for(i=0;i<N;i++)
		scanf("%d",&a[i]);
		s=0;
        for(i=0;i+M<=N;i++)//控制开始位置
        {
            for(k=M;i+k<=N;k++)//求和区间
            {
                sum=0.0;
                for(j=0;j<k;j++)
                sum+=a[i+j];
                s=max(sum/k,s);
            }
        }
        printf("%d\n",(int)(s*1000));
    }
}