Compilare: user.cpp: In function ‘std::pair<int, int> Solve(int, int)’: user.cpp:60:35: warning: array subscript has type ‘char’ [-Wchar-subscripts] return make_pair(cost[s[a]][s[b]], cost[s[b]][s[a]]); ^ user.cpp:60:41: warning: array subscript has type ‘char’ [-Wchar-subscripts] return make_pair(cost[s[a]][s[b]], cost[s[b]][s[a]]); ^ user.cpp:60:53: warning: array subscript has type ‘char’ [-Wchar-subscripts] return make_pair(cost[s[a]][s[b]], cost[s[b]][s[a]]); ^ user.cpp:60:59: warning: array subscript has type ‘char’ [-Wchar-subscripts] return make_pair(cost[s[a]][s[b]], cost[s[b]][s[a]]); ^ user.cpp:72:92: warning: array subscript has type ‘char’ [-Wchar-subscripts] newBest[0][0] = max(best[0][0], best[0][1]) + now.first + cost[s[i - 1]][s[i]]; ^ user.cpp:72:98: warning: array subscript has type ‘char’ [-Wchar-subscripts] newBest[0][0] = max(best[0][0], best[0][1]) + now.first + cost[s[i - 1]][s[i]]; ^ user.cpp:73:93: warning: array subscript has type ‘char’ [-Wchar-subscripts] newBest[0][1] = max(best[0][0], best[0][1]) + now.second + cost[s[i - 1]][s[other[i]]]; ^ user.cpp:73:106: warning: array subscript has type ‘char’ [-Wchar-subscripts] newBest[0][1] = max(best[0][0], best[0][1]) + now.second + cost[s[i - 1]][s[other[i]]]; ^ user.cpp:74:92: warning: array subscript has type ‘char’ [-Wchar-subscripts] newBest[1][0] = max(best[1][0], best[1][1]) + now.first + cost[s[i - 1]][s[i]]; ^ user.cpp:74:98: warning: array subscript has type ‘char’ [-Wchar-subscripts] newBest[1][0] = max(best[1][0], best[1][1]) + now.first + cost[s[i - 1]][s[i]]; ^ user.cpp:75:93: warning: array subscript has type ‘char’ [-Wchar-subscripts] newBest[1][1] = max(best[1][0], best[1][1]) + now.second + cost[s[i - 1]][s[other[i]]]; ^ user.cpp:75:106: warning: array subscript has type ‘char’ [-Wchar-subscripts] newBest[1][1] = max(best[1][0], best[1][1]) + now.second + cost[s[i - 1]][s[other[i]]]; ^ user.cpp:78:79: warning: array subscript has type ‘char’ [-Wchar-subscripts] newBest[0][0] = max(best[0][0] + now.first + cost[s[i - 1]][s[i]], best[0][1] + now.first + cost[s[other[i - 1]]][s[i]]); ^ user.cpp:78:85: warning: array subscript has type ‘char’ [-Wchar-subscripts] newBest[0][0] = max(best[0][0] + now.first + cost[s[i - 1]][s[i]], best[0][1] + now.first + cost[s[other[i - 1]]][s[i]]); ^ user.cpp:78:133: warning: array subscript has type ‘char’ [-Wchar-subscripts] newBest[0][0] = max(best[0][0] + now.first + cost[s[i - 1]][s[i]], best[0][1] + now.first + cost[s[other[i - 1]]][s[i]]); ^ user.cpp:78:139: warning: array subscript has type ‘char’ [-Wchar-subscripts] newBest[0][0] = max(best[0][0] + now.first + cost[s[i - 1]][s[i]], best[0][1] + now.first + cost[s[other[i - 1]]][s[i]]); ^ user.cpp:79:80: warning: array subscript has type ‘char’ [-Wchar-subscripts]