wenbao与hiho最短路还原

http://hihocoder.com/problemset/problem/1379

#include <iostream>
#include <stdio.h>
using namespace std;
int a[305][305], mark[305][305];
int main(){
    int n, num = 0;
    scanf("%d", &n);
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            scanf("%d", &a[i][j]);
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = i+1; j <=n; j++){
            for(int k = 1; k <= n; k++){
                if(k != i && k != j && !mark[i][j] && a[i][k]+a[k][j] == a[i][j]){
                    // cout<<i<<"------"<<j<<endl;
                    mark[i][j] = mark[j][i] = 1;
                    num++;
                }
            }
        }
    }
    // cout<<num<<endl;
    printf("%d
", (n*(n-1))/2 - num);
    return 0;
}

只有不断学习才能进步！