算法题：地铁站建站最小花费

最新推荐文章于 2024-09-26 21:39:47 发布

Rover1234

最新推荐文章于 2024-09-26 21:39:47 发布

阅读量745

点赞数

CC 4.0 BY-SA版权

分类专栏：笔试面试题

本文链接：https://blog.youkuaiyun.com/Rover1234/article/details/23295093

笔试面试题专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一种求解地铁线路最小建设成本的算法。给定每个站点的三种类型（地面站U、地下站D、复合站C）的建设费用，算法确保相邻站点类型不重复的前提下，计算出整个地铁线路建设的最低总成本。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

There are total N stations in a Metro Line.Those stations can be divided into three types: U(ground),D(underground) and C(composite).The construction cost of each station differs throughout the Metro Line. It should be noted that the adjacent station type can not be repeated. Given the construction costs of three types for each station,you are required to find out the minimum cost of constructing this Metro Line.For example,

	U	D	C
Station1	1	9	9
Station2	9	1	9
Station3	9	9	1

The minimum cost is:1+1+1=3.

#include <iostream>
#include <math.h>
using namespace std;
#define N 3
int minCost(int i,int j,int *p)
{
  int result=*(p+i*3+j);
  if(i<N-1)
  {
    result+=min(minCost(i+1,(j+1)%3,p),
                minCost(i+1,(j+2)%3,p));
  }
  return result;
}

int main()
{
  int stationCost[N*3]={1,9,9,9,1,9,9,9,1};
  int a=minCost(0,0,stationCost);
  int b=minCost(0,1,stationCost);
  int c=minCost(0,2,stationCost);
  int result=min(min(a,b),c);
  cout<<result<<endl;
  return 0;
}