ANUARM: A codechef problem

anuarm_codechef.cpp

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

int main() {
	int t;
	cin >> t;
	while(t--) {
	    int n,m;
	    cin >> n >> m;
	    vector<int> max_nums(n);
	    int min_m = n, max_m = -1;
	    int i;
	    for(i = 0; i < m; i++) {
	        int ind;
	        cin >> ind;
	        min_m = min(min_m, ind);
	        max_m = max(max_m, ind);
	    }
	    
	    for(int i = 0; i < n; i++) {
	        cout << max( abs(i-max_m), abs(i-min_m) ) << " ";
	    }
	    cout << endl;
	}
	return 0;
}