2018阿里测试题

       今天看了一下阿里的测试题，半个小时说实话时间还是挺紧张的，也被虐的够呛，没做出来，因为时间紧张，当时算法的一些细节问题也没想清楚，结束后，有整理了一下思路，看了看大神们的讨论，自己也整理了一套AC的代码。

 

        具体的思路是深度优先遍历。

 

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

class Solution{
public:
    void findPath(int key){
        time += times[key];
        path.push_back(key);

        //cout << "key: " << time << endl;

        multimap<int, int>::iterator iter;
        iter = m_sRelev.find(key);

        if(iter != m_sRelev.end()){
            int n = m_sRelev.count(key);
            for(int i=0; i<n; i++, iter++){
                findPath(iter->second);
            }
        }
        else{
            paths.push_back(path);

            maxTime = maxTime>time ? maxTime:time;
            minTime = minTime<time ? minTime:time;
        }
        path.pop_back();
        time -= times[key];
    }
    void scanRead(){
        cin >> numSystem >> numConnect;

        times.push_back(0);
        for(int i=0; i<numSystem; i++){
            int ts;
            cin >> ts;
            times.push_back(ts);
            minTime += ts;
        }

        for(int i=0; i<=numSystem; i++){
            isHead.push_back(1);
        }

        for(int i=0; i<numConnect; i++){
            int key, val;
            cin >> key >> val;
            m_sRelev.insert(make_pair(key, val));
            isHead[val] = 0;
        }

        /*for(auto& iter : m_sRelev){
            cout << iter.first << "  " << iter.second << endl;
        }*/

        maxTime = 0;
        time = 0;

        for(int i=1; i<=numSystem; i++){
            if(isHead[i]){
                findPath(i);
            }
        }
        cout << minTime << " " << maxTime << " " << paths.size() << endl;
    }

private:
    int numSystem, numConnect;
    vector<int> path;
    vector<vector<int> > paths;
    vector<int> times;
    vector<bool> isHead;
    multimap<int, int> m_sRelev;
    int time;
    int maxTime;
    int minTime;
};

int main()
{
    Solution solve;
    solve.scanRead();

    return 0;
}