nyoj1242 interference signal 省九

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 66 42103859415 210385 9 

样例输出

65007333

来源

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

上传

#include<stdio.h>
#include<cstring>
#include<algorithm>
using namespace std;
int a[2005];
int main()
{
	int t,n,m;
	scanf("%d",&t);
	while(t--)
	{
		memset(a,0,sizeof(a));
		double sum,max;
		scanf("%d%d",&n,&m); //m表示至少求连续m个数的平均数，可以超过m个数，只要平均数大 
		for(int i=0;i<n;i++)
		scanf("%d",&a[i]);
		
		for(int i=0;i<=n-m;i++)//i代表一串整数的第几位 i表示循环起始位置
		{
			for(int k=m;k<=n&&i+k<=n;k++)//k代表当前遍历长度即求和区间 
			{
				sum=0;
				for(int j=0;j<k;j++)//j表示区间长度 
				sum+=a[i+j];
				if(sum/k>max)
				max=sum/k;
			}
		}
		printf("%d\n",(int)(max*1000));
	}
}