摘要：
线段树，第一次写，2516K 1829MS#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>#include<algorithm>using namespace std;int cow[50005];#define my_max 1000010#define my_min -1000010int resmax;int resmin;struct node{ int nmax; int nmin; int L; int R; node *left; 阅读全文
摘要：
//252K 16MS注意隔板不按顺序给出#include<stdio.h>#include<string.h>#include<stdlib.h>#include<algorithm>using namespace std;int n,m;double x1,y1,x2,y2;struct point{ double x; double y;};struct T{ point a; point b;//a点在b点上方}line[5500];int res[5500];point temp;bool check(point p,T lin)//判 阅读全文