Sdywolf的博客

环上的边都是B，路径直接在DFS树上打标机就可以了。代码#include<cstdio> #include<cstring> #include<algorithm> #define maxn 100006 using namespace std; inline char nc(){ static char buf[100000],*i=buf,*j=buf; return i==j&

从大到小排序，枚举a中选几个，在b中三分。代码#include<cstdio> #include<cstring> #include<algorithm> #define maxn 100006 using namespace std; int n; double ans,a[maxn],b[maxn]; bool cmp(double x,double y){return x>y;} double