ME4546的专栏

#include #include using namespace std; #define N 201 struct node { int l,r,cover; double len; int getmid(){ return (r+l)>>1; } }p[3*N]; struct Line { double l,r,h; int flag; }L[N]; double h[N]; double X[N];

http://acm.hdu.edu.cn/showproblem.php?pid=3450#include #include using namespace std; #define mod 9901 #define N 100005 int a[N],b[

http://acm.hdu.edu.cn/showproblem.php?pid=2492#includeusing namespace std;#define N 100001#define M 20001__int64 c[N];int a[M];__int64 L[M],R[M];int lowbit(int x){ return x&(-x);}

<br />http://poj.org/problem?id=3468<br />#include<iostream> using namespace std; #define N 100001 struct node { int l,r; long long sum; long long type; int getmid(){ return (l+r)>>1; } int getdis(){ return r-l+1; } }p[3*N]; int a

<br />http://acm.hdu.edu.cn/showproblem.php?pid=1698<br />#include<iostream> using namespace std; #define N 100001 struct node { int l,r; int type; int getmid(){ return (l+r)>>1; } int getdis(){ return r-l+1;

<br />http://poj.org/problem?id=2777<br />#include<iostream> #include<cstdio> #include<cstring> using namespace std; #define N 100001 struct node { int l,r; int type; int getmid(){ return (l+r)>>1; } }p[4*N]; bool h[N]; void build(int l

<br />http://poj.org/problem?id=3264<br />#include<iostream> #include<cstdio> #include<cstring> #define N 50000 using namespace std; int a[N]; struct node { int l,r; int _max,_min; int getmid(){ return (l+r)>>1; } }p[N*4]; int

<br />题意：给你N个排列不规则的数，任务是把它从小到大排好，每次只能交换相邻两个数，交换一次的代价为两数之和，求最小代价<br />#include<iostream> using namespace std; #define N 100001 int n; struct node { int index; __int64 sum; }c[N]; int lowbit(int x) { return x&(-x); } void update(int x,int k,i

#include using namespace std; #define N 3000005 int c[10001]; int a[N]; int lowbit(int x) { return x&(-x); } void update(int x,int k) { while(x0) { ans+=c[x]; x-=lowbit(x); } return ans; } int main(void) { int n; while(~scan

题目大意：求矩形相交部分面积和#include #include using namespace std; #define N 2001 struct node {     int l,r,cover;     double one_len,more_len;     int getmid(){         return (l+r)>>1;     } }p[3*N]; struct Line {     double l,r,h;     int flag; }L[N]

一.下标是否为0......二.数据是否有重复的值三.数据是否要离散化四.操作区间 [x,y], x是否大于y暂时记到这里