wuzhibin

摘要： #include <iostream>#include <cmath>#include <algorithm>using namespace std;const int N=510;const int Max=20000;int n;double a[N],d[N][N];bool f[N];struct point{ int x,y;}p[N];bool cmp(double x,double y){ return (x>y);}double dist(point p1,point p2){ return(sqrt((double)(p1.x-p2. 阅读全文

摘要： /*This Code is Submitted by billforum for Problem 1653 at 2012-02-14 13:38:42*/#include <iostream>using namespace std;const int N=1005;const int Max=1000002;int n,v[N],p[N][N];bool f[N];int min(int x,int y){ return(x<y?x:y);}void init(){ for(int i=1;i<=n;i++) { f[i]=0; v[i]=0;... 阅读全文