HackerRank "Flatland Space Stations"

A bit Greedy can achieve O(m) - the mid station between 2 adjacent cities has the longest distance within that range.

#include <vector>
#include <iostream>
using namespace std;

int main(){
    int n;
    int m;
    cin >> n >> m;
    vector<int> c(m);
    for(int c_i = ;c_i < m;c_i++){
       cin >> c[c_i];
    }
    sort(c.begin(), c.end());
    int r = ;
    for(int i =; i < m - ; i ++)
    {
        r = max(r, (c[i + ] - c[i])/);
    }
    r = max(r, c[]);
    r = max(r, n - c.back() - );
    cout << r << endl;

    return ;
}