here is my code can anyone find the problem.....???????
#include<iostream>
using namespace std;
long long cost[1000][1000];
int q[1000][2];
int n,e,que;
void floyd(int con){ //floyd algo
int i,j,k;
for(k=1;k<=n;k++){
for(j=1;j<=n;j++){
for(i=1;i<=n;i++){
cost[i][j]=min(cost[i][j],max ...