摘要：Problem Description King OMeGa catched three men who had been streaking in the street. Looking as idiots though, the three men insisted that it was a 阅读全文

摘要：C 有n个节点和m边条，求一条最长的路径，该路径(c1,c2,c3...cn)满足 不出现重复的节点，ci 和ci+1是邻居节点，且 ci 的邻居节点数量小于ci+1的邻居节点数量。 记忆DFS遍历，每次递归计算的值都保存在数组里，这样复杂度相当于O(m) 1 #include <bits/stdc 阅读全文