/* 题目: 给出n个铜件,每个铜件拥有银和金的含量si,gi,然后问最终把这些铜件融在一起后 银的含量为m,然后问金的含量大概有多少 分析: 将金银映射为坐标,将银的含量表示为x轴的坐标,然后金的含量表示为y轴,然后求 凸包,接着做垂直于x轴的直线,交凸包于两点,那两点即为所求,若没有的话,直接 输出0 注意: 1.点都在凸包上的直线 2.点在凸包上的点 3.点不在凸包上的范围内 4.求出的两点大小相反 */ #include <iostream> #include <cstdio> #include <cstring> #include <cmath> #include <algorithm> using namespace std; const int X = 5005; #define debug puts("here"); #define esp 1e-8 int n,m; struct node { double x,y; friend bool operator < (node a,node b) { return a.y<b.y||(a.y==b.y&&a.x<b.x); } }res[X],p[X]; int top; int dcmp(double x) //判断是否为0 { if(abs(x)<esp) return 0; return x<0?-1:1; } int det(double x1,double y1,double x2,double y2) { return dcmp(x1*y2-x2*y1); } bool del(int top,int i) { if(det(res[top].x-res[top-1].x,res[top].y-res[top-1].y,p[i].x-res[top].x,p[i].y-res[top].y)<=0) return true; return false; } void graham() { top = 1; res[0] = p[0]; res[1] = p[1]; for(int i=2;i<n;i++) { while(top&&del(top,i)) top--; res[++top] = p[i]; } int mint = top; res[++top] = p[n-2]; for(int i=n-3;i>=0;i--) { while(top!=mint&&del(top,i)) --top; res[++top] = p[i]; } } double a[5]; int cnt; void cal(int i) //计算交点 { int x1,y1,x2,y2; x1 = res[i].x; y1 = res[i].y; x2 = res[i+1].x; y2 = res[i+1].y; a[cnt++] = y1+(m-x1)*1.0*(y2-y1)/(x2-x1); } void solve() { a[0] = a[1] = 0; cnt = 0; for(int i=0;i<top;i++) if(m>=min(res[i].x,res[i+1].x)&&m<=max(res[i].x,res[i+1].x)) { if(cnt==2) break; if(dcmp(res[i].x-m)==0&&dcmp(res[i+1].x-m))//刚好重叠于凸包上的线段 { a[cnt++] = min(res[i].y,res[i+1].y); a[cnt++] = max(res[i].y,res[i+1].y); continue; } if(dcmp(res[i].x-m)==0) //刚好为凸包上的点 { a[cnt++] = res[i].y; continue; } if(dcmp(res[i+1].x-m)==0) //刚好为下一位时,i需要加一 { a[cnt++] = res[i+1].y; i++; continue; } cal(i); } if(a[0]>a[1]) swap(a[0],a[1]); printf("%.3lf %.3lf\n",a[0],a[1]); } int main() { //freopen("sum.in","r",stdin); while(cin>>n>>m) { for(int i=0;i<n;i++) scanf("%lf",&p[i].x); for(int i=0;i<n;i++) scanf("%lf",&p[i].y); sort(p,p+n); graham(); solve(); } return 0; }
转载于:https://www.cnblogs.com/yejinru/archive/2012/08/10/2631261.html