SRM470 Div2 Easy(250) LinearTravellingSalesman
#include <vector> #include <algorithm> using namespace std; class LinearTravellingSalesman { public: int findMinimumDistance( vector <int> x, vector <int> y ); }; int LinearTravellingSalesman::findMinimumDistance( vector <int> x, vector <int> y ) { return *max_element(x.begin(),x.end())-*min_element(x.begin(),x.end()) + *max_element(y.begin(),y.end())-*min_element(y.begin(),y.end()); }