hihocoder #1249 枚举

求出从每一条线分割 坐标绿洲的面积

#include<iostream>  
#include<map>
#include<string.h>   
#include<algorithm>  
#include<fstream>
#include<cmath>  
#include<vector>
#include<stack>
#include<map>
#include<math.h>
using namespace std;  
#define lch(i) ((i)<<1)  
#define rch(i) ((i)<<1|1)  
#define sqr(i) ((i)*(i))  
#define pii pair<int,int>  
#define mp make_pair  
#define FOR(i,b,e) for(int i=b;i<=e;i++)  
#define FORE(i,b,e) for(int i=b;i>=e;i--)  
#define ms(a)   memset(a,0,sizeof(a))  
const int maxnum =1000003;
const  int  INF = 200000001;
int n,r;
unsigned long long line[maxnum];


int cmp(const void* a,const void* b){
	return *(int*)a-*(int*)b;
}

int main()    
{  
#ifdef _DEBUG_
	fstream fin("G:/1.txt");
#else
#define fin cin
#endif
	int k;
	fin>>k;
	while(k--){
		int ans;
		fin>>r;
		fin>>n;
		ms(line);
		unsigned long long x,y,h,w;
		unsigned long long total=0;
		FOR(i,1,n){
			fin>>x>>y>>w>>h;
			total+=w*h;
			FOR(i,x+1,x+w){
				line[i]+=h;
			}
		}
		FOR(i,2,r)
			line[i]+=line[i-1];
		FOR(i,1,r){
			if(line[i]*2>=total){
				while(i+1<=r&&line[i+1]==line[i]) i++;
				ans=i;
				break;
			}
		}
		cout<<ans<<endl;
	}
	return 0;  
}