技术烂人

原题： Hire and Fire Time Limit: 2 Seconds      Memory Limit: 65536 KB In this problem, you are asked to keep track of the hierarchical structure of an organization's changing staff. As the fi

求最长非升子序列长度，主要使用dfs（递归实现）以及dp两种方法。源码如下： #include using namespace std; //overrall variable int * numbers; int * dp; int nums; int max_length_dfs; int max_length_dp; //dfs-recursively implemented