Warning: session_start(): open(/tmp/sess_5a29c7e9fbfe7e439d09c8a3520c20a5, O_RDWR) failed: No space left on device (28) in /data/wiki/inc/init.php on line 239

Warning: session_start(): Failed to read session data: files (path: ) in /data/wiki/inc/init.php on line 239

Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/auth.php on line 430
Writing /data/wiki/data/cache/4/43994124a9168f34c03db2ff7cd35d94.captchaip failed

Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/Action/Export.php on line 103

Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/Action/Export.php on line 103

Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/Action/Export.php on line 103
/* 朱刘算法是干什么的呢 给定一个有向图以及点X,求以X为根节点的最小生成树(有向) */ #include #include #include #include #include #define maxn 10005 using namespace std; struct nod { int x,y; double w; nod(){} }edge[maxn]; int n,m,root; double x[maxn],y[maxn]; int id[maxn],vis[maxn],pre[maxn]; double in[maxn]; double zhuliu() { double ans=0; int sz=n; while(1) { for(int i=1;i<=sz;i++) in[i]=123456789.0,vis[i]=id[i]=0; for(int i=1;i<=m;i++) { if( edge[i].w