POJ - 2926 Requirements

题意：多维的曼哈顿最远距离

思路：做了1，2，3维的，其实就是枚举所有绝对值的可能的表达式

#include 
  
   
#include 
   
     #include 
    
      #include 
     
       using namespace std; const int MAXN = 100005; const int M = 5; const double inf = 1e200; struct node{ double x[M]; }p[MAXN]; int n; double minx[1<
      
       >= 1; } if (maxx[j] < s) maxx[j] = s; if (minx[j] > s) minx[j] = s; } for (i = 0; i < tmp; i++) if (maxx[i]-minx[i] > ans) ans = maxx[i] - minx[i]; return ans; } int main(){ while (scanf("%d", &n) != EOF){ for (int i = 0; i < n; i++) for (int j = 0; j < M; j++) scanf("%lf", &p[i].x[j]); printf("%.2f\n",solve()); } return 0; }