一只小陀螺的博客

题目：According to Wikipedia:Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data...

题目：According to Wikipedia:Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data...

题目：Given the relations of all the activities of a project, you are supposed to find the earliest completion time of the project.Input Specification:Each input file contains one test case. Each case st...

补个档，问题不贴了输入格式:输入第1行给出正整数K (≤)；第2行给出K个整数，其间以空格分隔。输出格式:在一行中输出最大子列和。如果序列中所有整数皆为负数，则输出0。输入样例:6-2 11 -4 13 -5 -2输出样例:20四种解法第一种三重循环直接开干复杂度O(N^3)#include<iostream>#include<algorithm>using nam...

题目：假定一个工程项目由一组子任务构成，子任务之间有的可以并行执行，有的必须在完成了其它一些子任务后才能执行。“任务调度”包括一组子任务、以及每个子任务可以执行所依赖的子任务集。比如完成一个专业的所有课程学习和毕业设计可以看成一个本科生要完成的一项工程，各门课程可以看成是子任务。有些课程可以同时开设，比如英语和C程序设计，它们没有必须先修哪门的约束；有些课程则不可以同时开设，因为它们有先后的依赖关...

题目：Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence o...