Soluciones y Explicación de los problemas ACM ... - ICPC Bolivia

Explicaciones a los problemas South American Regionals 2008 56
Programa Java que soluciona el problema
import java.util.*;
class tsp {
static final int MAX_N = 100;
static final int MAX_M = 500;
static int M, N;
static int[][] edge = new int[MAX_M + 1][2];
static int[][] inc = new int[MAX_N + 1][MAX_M];
static int[] d = new int[MAX_N + 1];
static int forbidden_edge, n_visited;
static int[] visited = new int[MAX_N + 1];
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int K, e, v, n_imp, j, res;
for (;;) {
M = in.nextInt();
N = in.nextInt();
if (M == 0) break;
Arrays.fill(d, 0);
for(int a=0;a