做法: 很简单的Floyd模板题……只是自己脑子ZZ了
这是一开始(WA)的代码
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 998244353;
const double PI = 4*atan(1.0);
const int maxm = 1e8+5;
const int maxn = 1e5+5;
const int INF = 0x3f3f3f3f;
int dp[505][505];
int len[maxn];
int n;
inline int read()
{
char x;
while((x = getchar())<'0' || x>'9');
int u = x-'0';
while((x = getchar())>='0' && x<='9') u = (u<<3)+(u<<1)+x-'0';
return u;
}
int main()
{
#ifdef LOCAL_FILE
freopen("in.txt","r",stdin);
#endif // LOCAL_FILE
while(~scanf("%d",&n)&& n)
{
memset(len,0,sizeof(len));
memset(dp,INF,sizeof(dp));
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
if(i == j)
dp[i][j] = dp[j][i] = 0;
}
}
int m,u,v;
m = read();
for(int i=0;i<m;i++)
{
u = read();v = read();
dp[u][v] = dp[v][u] = 1;
}
int mx = -1;
for(int k=0;k<n;k++)
{
for(int i=0;i<n;i++){
for(int j=0;j<n;j++)
{
dp[i][j] = min(dp[i][j],dp[i][k]+dp[k][j]);
if(dp[i][j]!=INF)
{
mx = max(mx,dp[i][j]);
}
}
}
}
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
len[dp[i][j]]++;
}
}
//cout<<mx<<endl;
for(int i=1;i<=mx;i++)
{
printf("%d %d\n",i,len[i]);
}
}
return 0;
}
自己还以为很对……其实是不应该利用dp过程中的中间态
比如这组样例:
5
5
0 1
1 2
2 3
0 4
4 3
我酱紫一定会输出3 0 这组错误数据,因为3这条路径不是最短路径……_(:з」∠)_ 脑子ZZ,ZZ……
感谢超霸指点 %% Σ(っ°Д°;)っ
AC代码:就是把寻找最长最短路径在所有状态确定完后找
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 998244353;
const double PI = 4*atan(1.0);
const int maxm = 1e8+5;
const int maxn = 1e5+5;
const int INF = 0x3f3f3f3f;
int dp[505][505];
int len[maxn];
int n;
inline int read()
{
char x;
while((x = getchar())<'0' || x>'9');
int u = x-'0';
while((x = getchar())>='0' && x<='9') u = (u<<3)+(u<<1)+x-'0';
return u;
}
int main()
{
#ifdef LOCAL_FILE
freopen("in.txt","r",stdin);
#endif // LOCAL_FILE
while(~scanf("%d",&n)&& n)
{
memset(len,0,sizeof(len));
memset(dp,INF,sizeof(dp));
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
if(i == j)
dp[i][j] = dp[j][i] = 0;
}
}
int m,u,v;
m = read();
for(int i=0;i<m;i++)
{
u = read();v = read();
dp[u][v] = dp[v][u] = 1;
}
for(int k=0;k<n;k++)
{
for(int i=0;i<n;i++){
for(int j=0;j<n;j++)
dp[i][j] = min(dp[i][j],dp[i][k]+dp[k][j]);
}
}
int mx = -1;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
if(dp[i][j]!=INF) mx = max(mx,dp[i][j]);
len[dp[i][j]]++;
}
}
for(int i=1;i<=mx;i++)
printf("%d %d\n",i,len[i]);
}
return 0;
}