最短路求调

#include <iostream>
#include <cstring>

using namespace std;

const int N = 201, INF = 0x3f3f3f3f;

int d[N][N];
bool vis[N];
int temp[N];

int n;

int dijsktra(int start, int end)
{

	int t = -1;
	for (int i=0;i<=N;i++)
	{
		temp[i] = INF;
	}
	
	temp[start] = 0;
	
	for (int i=1;i<=n;i++)
	{
		t = -1;
		for (int j=1;j<=n;j++)
		{
			if (!vis[j] && (t==-1||temp[j]<temp[t]))
			{
				t = j;
			}
			
		}
		vis[t] = true;
		
		
		for (int k=1;k<=n;k++)
		{
			temp[k] = min(temp[k], temp[t]+d[t][k]);
			
		}
		
	}
	

	
	return temp[end];
}

int main()
{
	cin >> n;
	
	int v;
	
	memset(d, INF, sizeof(d));
	
	for (int i=1;i<=n;i++)
	{
		d[i][i] = 0;
	}
	
	for (int i=1;i<=n;i++)
	{
		for (int j=i+1;j<=n;j++)
		{
			cin >> v;
			d[i][j] = v;
		}
	}
	
	int value = dijsktra(1, n);
	cout << value;
	
	
	
	
	return 0;
}