###### ZSQ

Description

#include<stdio.h>
int main()
{
int m,n,k,i;
double kk[10001],sum[10001],pm[10001],pn[10001],eps=1e-9;
scanf("%d%d%d",&m,&n,&k);
sum[0]=0;
for(i=1;i<=k;i++)
{
scanf("%lf",&kk[i]);
sum[i]=sum[i-1]+kk[i];
}
for(i=n;i<=k;i++)
pn[i]=(double)(sum[i]-sum[i-n])/n;
for(i=m;i<=k;i++)
pm[i]=(double)(sum[i]-sum[i-m])/m;
if(pm[n]-pn[n]>eps)
else if(pn[n]-pm[n]>eps)
printf("SELL ON DAY %d\n",n);
for(i=n+1;i<=k;i++)
{
if(pm[i]-pn[i]>eps&&pn[i-1]-pm[i-1]>eps)
else if(pn[i]-pm[i]>eps&&pm[i-1]-pn[i-1]>eps)
printf("SELL ON DAY %d\n",i);
}
return 0;
}

#### poj - 2163 - Easy Trading

2013-08-31 23:50:32

2014-08-14 21:31:15

#### poj-2826 An Easy Problem?!（计算几何，好题）

2016-04-28 14:37:55

#### POJ 2826 An Easy Problem?! （计算几何、线段相交、思维）

2016-08-25 15:17:06

#### poj-2826 An Easy Problem?!

2015-09-06 22:27:47

#### POJ-2446 Chessboard

2011-12-01 15:56:22

#### POJ2388-排序水题

2016-09-08 11:19:30

#### POJ1101The Game

2013-05-28 19:41:49

#### POJ 2163

2014-08-02 14:55:15

#### [BZOJ2163]复杂的大门（最大流）

2016-02-21 17:07:30