打卡信奥刷题（1294）用C++实现信奥 P2935 [USACO09JAN] Best Spot S

最新推荐文章于 2026-06-17 19:38:50 发布

原创最新推荐文章于 2026-06-17 19:38:50 发布 · 4.8k 阅读

19 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#c++ #开发语言 #算法 #青少年编程

C++ 专栏收录该内容

3452 篇文章

订阅专栏

P2935 [USACO09JAN] Best Spot S

题目描述

Bessie, always wishing to optimize her life, has realized that she really enjoys visiting F (1 <= F <= P) favorite pastures F_i of the P (1 <= P <= 500; 1 <= F_i <= P) total pastures (conveniently

numbered 1…P) that compose Farmer John’s holdings.

Bessie knows that she can navigate the C (1 <= C <= 8,000) bidirectional cowpaths (conveniently numbered 1…C) that connect various pastures to travel to any pasture on the entire farm. Associated with each path P_i is a time T_i (1 <= T_i <= 892) to traverse that path (in either direction) and two path endpoints a_i and b_i (1 <= a_i <= P; 1 <= b_i <= P).

Bessie wants to find the number of the best pasture to sleep in so that when she awakes, the average time to travel to any of her F favorite pastures is minimized.

By way of example, consider a farm laid out as the map below shows, where *'d pasture numbers are favorites. The bracketed numbers are times to traverse the cowpaths.


            1*--[4]--2--[2]--3
                     |       |
                    [3]     [4]
                     |       |
                     4--[3]--5--[1]---6---[6]---7--[7]--8*
                     |       |        |         |
                    [3]     [2]      [1]       [3]
                     |       |        |         |
                    13*      9--[3]--10*--[1]--11*--[3]--12*

The following table shows distances for potential ‘best place’ of pastures 4, 5, 6, 7, 9, 10, 11, and 12:

      * * * * * * Favorites * * * * * *
 Potential      Pasture Pasture Pasture Pasture Pasture Pasture     Average
Best Pasture       1       8      10      11      12      13        Distance
------------      --      --      --      --      --      --      -----------
    4              7      16       5       6       9       3      46/6 = 7.67
    5             10      13       2       3       6       6      40/6 = 6.67
    6             11      12       1       2       5       7      38/6 = 6.33
    7             16       7       4       3       6      12      48/6 = 8.00
    9             12      14       3       4       7       8      48/6 = 8.00
   10             12      11       0       1       4       8      36/6 = 6.00 ** BEST
   11             13      10       1       0       3       9      36/6 = 6.00
   12             16      13       4       3       0      12      48/6 = 8.00

Thus, presuming these choices were the best ones (a program would have to check all of them somehow), the best place to sleep is pasture 10.

约翰拥有 $\leq P \leq 500)$ 个牧场，贝茜特别喜欢其中的 $F$ 个。所有的牧场由 $\leq 8000)$ 条双向路连接，第 $i$ 条路连接着 $a_i,b_i$ ，需要 $Ti(1≤Ti<892)T_i(1 \leq T_i < 892)$ 个单位时间来通过。

作为一只总想优化自己生活方式的奶牛，贝茜喜欢自己某一天醒来，到达所有那 $F$ 个她喜欢的牧场的平均需时最小。那她前一天应该睡在哪个牧场呢？请帮助贝茜找到这个最佳牧场。

由样例解释可见，在样例环境下，牧场 $10$ 到所有贝茜喜欢的牧场的平均距离最小，为最佳牧场。

输入格式

* Line 1: Three space-separated integers: P, F, and C

* Lines 2…F+1: Line i+2 contains a single integer: F_i

* Lines F+2…C+F+1: Line i+F+1 describes cowpath i with three

space-separated integers: a_i, b_i, and T_i

输出格式

* Line 1: A single line with a single integer that is the best pasture in which to sleep. If more than one pasture is best, choose the smallest one.

输入输出样例 #1

输入 #1

输出 #1

说明/提示

As the problem statement

As the problem statement.

C++实现

#include<bits/stdc++.h>
const int inf=0x3fffffff;
using namespace std;
int n,m,p,like[501];
int ans,mi=inf,f[501][501];
int main()
{
	int i,j,k,u,v,c,sum;
	cin>>n>>p>>m;
	for(i=1;i<=n;i++)
	{
	  for(j=1;j<=n;j++) f[i][j]=inf;
	  f[i][i]=0;
	}
	for(i=1;i<=p;i++) cin>>like[i];
	for(i=1;i<=m;i++)
	{
	  cin>>u>>v>>c;
	  f[u][v]=c;
	  f[v][u]=c;
	}
	for(k=1;k<=n;k++)
	  for(i=1;i<=n;i++)
	    for(j=1;j<=n;j++)
	      f[i][j]=min(f[i][j],f[i][k]+f[k][j]);//DP动态转移方程
	for(i=1;i<=n;i++)
	{
	  sum=0;
	  for(j=1;j<=p;j++) sum+=f[i][like[j]];
	  if(sum<mi){mi=sum; ans=i;}
	}
	cout<<ans<<endl;
	return 0;
}