HDU 2993 MAX Average Problem 斜率优化

http://acm.hdu.edu.cn/showproblem.php?pid=2993

#include<iostream>
using namespace std;
#define N 100005
double sum[N];
int n,k;
int q[N],head,tail;
void solve(){
	head=tail=0;
	q[0]=0;
	double ret=-1;
	for(int i=k;i<=n;i++){
		int p=i-k;
		while(head<tail){
			double x1=p-q[tail];
			double y1=sum[p]-sum[q[tail]];
			double x2=q[tail]-q[tail-1];
			double y2=sum[q[tail]]-sum[q[tail-1]];
			if(y1*x2<=x1*y2) tail--;
			else break;
		}
		q[++tail]=p;
		while(head<tail){
			double x1=i-q[head];
			double y1=sum[i]-sum[q[head]];
			double x2=i-q[head+1];
			double y2=sum[i]-sum[q[head+1]];
			if(x1*y2>=y1*x2) head++;
			else break;
		}
		double temp=(sum[i]-sum[q[head]])/(i-q[head]);
		if(ret<temp) ret=temp;
	}
	printf("%.2lf\n",ret);
}
int GetInt(){
    char ch=getchar();
    while(ch<'0'||ch>'9')ch=getchar();
    int num=0;
    while(ch>='0'&&ch<='9'){
        num=num*10+ch-'0';
        ch=getchar();
    }
    return num;
}
int main(void){
	while(~scanf("%d%d",&n,&k)){
		sum[0]=0;
		for(int i=1;i<=n;i++){
			sum[i]=GetInt();
			sum[i]+=sum[i-1];
		}
		solve();
	}
}

要加外挂才能过，少见。。。