#include "towns.h" #include <bits/stdc++.h> using namespace std; const int N = 200; int d0[N], d1[N], D[N]; int hubDistance(int n, int sub) { assert(sub >= 0); d0[0] = 0; for(int i = 1; i < n; i++) d0[i] = getDistance(0, i); int mx = max_element(d0, d0 + n) - d0; d1[0] = d0[mx]; for(int i = 1; i < n; i++) d1[i] = (i == mx ? 0 : getDistance(i, mx)); int dia = *max_element(d1, d1 + n); int R = 2000000; for(int i = 0; i < n; i++){ int X = (d0[i] + d1[i] - d0[mx]) / 2; int P = d1[i] - X; R = min(R, max(P, dia - P)); } return R; //map<int, vector<int> > mp; return R; }

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:16:35: warning: conversion from 'long int' to 'int' may change value [-Wconversion]
   16 |  int mx = max_element(d0, d0 + n) - d0;
      |           ~~~~~~~~~~~~~~~~~~~~~~~~^~~~