sky_zdk的博客

#include #define MAX_N 100000+16 typedef struct { int s,f; int rank; }Cow; int N,C,F,half; Cow cow1[MAX_N],cow2[MAX_N]; void qsort1(int l,int r); void qsort2(int l,int r); int main(void) { int i,to

#include #define exp 1e-6 double d[1000+16]; double A,res; int N; int judge(double x) {     int i;     d[0]=A;     d[1]=x;     for(i=2;i     {          d[i]=2*(d[i-1]+1)-d[i-2];          

#include #include #include #include #define INF 0x3f3f3f3f #define MAX(x,y) ((x)>(y)?(x):(y)) #define MIN(x,y) ((x)>(y)?(y):(x)) using namespace std; struct node { int l,r,w; }d[100100]; int L,R,n; b