阿里巴巴测评题:
思路:从某一个顶点开始,对其进行深搜,找到以它开始的左右路径,注意必须从头结点开始。代码如下:
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
using std::vector;
using std::map;
void findPath( multimap<int,int>& path,vector<bool>& isHead,vector<vector<int>>& res,vector<int>& tmp,int v );
int main()
{
int n, m;
while (cin >> n >> m)
{
vector<int> time(n + 1,0);
vector<bool> isHead(n + 1, true);
for (int i = 1; i <= n; ++i)
{
int t;
cin >> t;
time[i] = t;
}
multimap<int, int> path;
for (int j =