hdoj MAX Average Problem 2993 （斜率优化DP）

最新推荐文章于 2020-10-23 12:27:05 发布

没有能与不能只有想与不想

最新推荐文章于 2020-10-23 12:27:05 发布

阅读量388

点赞数

分类专栏： hdoj 数论方程数学几何好题技巧&&思想

本文链接：https://blog.csdn.net/yanghui07216/article/details/50768842

版权

hdoj 同时被 3 个专栏收录

426 篇文章 3 订阅

订阅专栏

好题

211 篇文章 1 订阅

订阅专栏

技巧&&思想

85 篇文章 0 订阅

订阅专栏

MAX Average Problem

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7613 Accepted Submission(s): 1667

Problem Description

Consider a simple sequence which only contains positive integers as a1, a2 ... an, and a number k. Define ave(i,j) as the average value of the sub sequence ai ... aj, i<=j. Let’s calculate max(ave(i,j)), 1<=i<=j-k+1<=n.

Input

There multiple test cases in the input, each test case contains two lines.
The first line has two integers, N and k (k<=N<=10^5).
The second line has N integers, a1, a2 ... an. All numbers are ranged in [1, 2000].

Output

For every test case, output one single line contains a real number, which is mentioned in the description, accurate to 0.01.

Sample Input

  
  
   
   10 6
6 4 2 10 3 8 5 9 4 1

Sample Output

  
  
   
   6.50
  
  
  
  
   
   //思路：
   
   http://www.docin.com/p-47950655.html
  
  
  
  
   
   一种新思想。。。
  
  
  
  
   
   //看网上的都是TLM。。。先贴上。。。
  
  
  
  
   
   #include<stdio.h>
#include<string.h>
#include<algorithm>
#define INF 0x3f3f3f3f
#define ll long long
#define N 100010
using namespace std;
int sum[N],s[N],a[N];
bool cross(int i,int j,int k)
{
	if((sum[j]-sum[i])*(k-i)>=(sum[k]-sum[i])*(j-i))
		return true;
	return false;
}
double fx(int i,int t)
{
	double tmp;
	tmp=1.0*(sum[t]-sum[i])/(t-i);
	return tmp;
}
int main()
{
	int n,k;
	int i;
	while(scanf("%d%d",&n,&k)!=EOF)
	{
		sum[0]=0;
		for(i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			sum[i]=sum[i-1]+a[i];
		}
		int top=0,low=0;
		double ans=0;
		for(i=k;i<=n;i++)
		{
			int j=i-k;
			while(top-low>=1&&cross(s[top-1],s[top],j))
				top--;
			s[++top]=j;
			while(top-low>=1&&fx(s[low+1],i)>=fx(s[low],i))
				low++;
			ans=max(ans,fx(s[low],i));
		}
		printf("%.2lf\n",ans);
	}
	return 0;
}