Angle and Squares UVA - 1643

 

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define per(i,a,b) for(int i=b-1;i>=a;i--)

/*
容易得到 当正方形都是对角线相连的时候，面积最大
所以只要找到 那两个交点，然后用叉积做一下就好了
*/

int main(){
   int n;
   while(scanf("%d",&n)==1&&n){
        double x1,y1,x2,y2;
        scanf("%lf %lf %lf %lf",&x1,&y1,&x2,&y2);
        if(y1/x1<y2/x2){
            swap(x1,x2),swap(y1,y2);
        }


        double sum_area=0,sum=0;

        rep(i,0,n){
            double tmp;
            scanf("%lf",&tmp);
            sum+=tmp;
            sum_area+=tmp*tmp/2.0;
        }
        double a1=y1/x1,a2=y2/x2;

        double A1=(a2+1)*sum/(a1-a2),B1=sum*a1*(a2+1)/(a1-a2);
        double A2=A1+sum,B2=B1-sum;


        double ans=fabs(A1*B2-A2*B1)*0.5;
        ans-=sum_area;
        printf("%.3f\n",ans);
   }
   return 0;
}