(C/C++)动态规划:多段图最短路径、有向无环图最短路径、最长递增不连续子序列

多段图的最短路径问题

建立一个从源点S到终点T的多段图，设计一个动态规划算法求出从S到T的最短路径值，并输出相应的最短路径。

思路

首先确定能分段，即每一层的各个结点互不连通，后驱结点均在同一层。
通过有一定修改的bfs进行分段，然后从最后一段，依段数逐段取最小路径，有点类似最小路径算法。

#include <iostream>
#include <vector>
#include <deque>
#define NODE_COUNT 8
#define MAX_SEG 5
#define INF 255
#define NO_NEXT -1
using namespace std;

int nodes[NODE_COUNT][NODE_COUNT];
int beginPos;
int endPos;

struct Segment {
	vector<int> nodes;
};

void setEdge(int graph[NODE_COUNT][NODE_COUNT], int from, int to, int weight) {
	graph[from][to] = weight;
}

bool isConnect(int graph[NODE_COUNT][NODE_COUNT], int from, int to) {
	return graph[from][to] != INF;
}

int getWeight(int graph[NODE_COUNT][NODE_COUNT], int from, int to) {
	return graph[from][to];
}

void setSegment(int graph[NODE_COUNT][NODE_COUNT], vector<Segment>& segments,int beginPos,int endPos) {
	int pos = beginPos;
	//避免同一段中结点被重复push
	bool check[NODE_COUNT] = {false};
	//bfs队列
	deque<int> nowSegNodes;
	nowSegNodes.push_back(beginPos);
	deque<int> nextSegNodes;
	//第一段只有beginPos
	Segment newSeg;
	segments.push_back(newSeg);
	segments[0].nodes.push_back(pos);
	int segIndex = 1;
	while (pos != endPos) {
		//cout << "现在在bfs" << pos << "结点" << endl;
		for (int i = 0; i < NODE_COUNT; i++) {
			if (!check[i] && isConnect(graph, pos, i)) {
				if (segments.size() - 1 < segIndex) {
					Segment newSeg;
					segments.push_back(newSeg);	
				}
				//分段
				//cout << i << "是第" << segIndex << "段" << endl;
				segments[segIndex].nodes.push_back(i);
				//入下一段的队
				nextSegNodes.push_back(i