poj 2926 Requirements （五维曼哈顿距离变换【拆点】）

 1#include <cstdio>
 2#include <cstring>
 3#include <iostream>
 4#include <algorithm>
 5#include <vector>
 6#include <queue>
 7#include <set>
 8#include <map>
 9#include <string>
10#include <cmath>
11#include <cstdlib>
12#include <ctime>
13#include <iomanip>
14#define fst first
15#define sec second
16#define lson l,m,rt<<1
17#define rson m+1,r,rt<<1|1
18#define ms(a,x) memset(a,x,sizeof(a))
19typedef long long LL;
20#define pi pair < int ,int >
21#define MP make_pair

 1using namespace std;
 2const double eps = 1E-8;
 3const int dx4[4]={1,0,0,-1};
 4const int dy4[4]={0,-1,1,0};
 5const int inf = 0x3f3f3f3f;
 6const int N=1E5+7;
 7double p[16][N];
 8int n;
 9int main()
10{
11	#ifndef  ONLINE_JUDGE 
12	freopen("code/in.txt","r",stdin);
13  #endif

 1	ios::sync_with_stdio(false);
 2	cin>>n;
 3	for ( int i = 0 ; i < n ;i++)
 4	{
 5	    double x1,x2,x3,x4,x5;
 6	    cin>>x1>>x2>>x3>>x4>>x5;
 7	    p[0][i]=x1+x2+x3+x4+x5;
 8	    p[1][i]=x1+x2+x3+x4-x5;
 9	    p[2][i]=x1+x2+x3-x4+x5;
10	    p[3][i]=x1+x2+x3-x4-x5;

1	    p[4][i]=x1+x2-x3+x4+x5;
2	    p[5][i]=x1+x2-x3+x4-x5;
3	    p[6][i]=x1+x2-x3-x4+x5;
4	    p[7][i]=x1+x2-x3-x4-x5;

1	    p[8][i]=x1-x2+x3+x4+x5;
2	    p[9][i]=x1-x2+x3+x4-x5;
3	    p[10][i]=x1-x2+x3-x4+x5;
4	    p[11][i]=x1-x2+x3-x4-x5;

1	    p[12][i]=x1-x2-x3+x4+x5;
2	    p[13][i]=x1-x2-x3+x4-x5;
3	    p[14][i]=x1-x2-x3-x4+x5;
4	    p[15][i]=x1-x2-x3-x4-x5;
5	}

1	double mx = -1;
2	for ( int i = 0 ; i < 16 ; i++)
3	{
4	    sort(p[i],p[i]+n);

1  #ifndef ONLINE_JUDGE  
2  fclose(stdin);
3  #endif
4    return 0;
5}