判断一个序列（从1―N，N<=10）的出 栈序列是否合法，合法序列输出YES，非 法输出NO。 例如：N=3，输入序列：1 2 3 或1 3...

ppciaxclient softphone

Windows API编程大全，不错的编程帮助-Encyclopedia of Windows API programming, good programming help

非常好用的源代码，是把程序转为服务的形式，可以在开机之后自动启动运行的源代码-Very easy to use source code is to process the form to the service can start automatically after boot to run the source code

建立10个优先级不同的任务，并且察看每个任务的Angel-Set up 10 different mission priorities and mission of each of the Angel View

A Slovienian Python tutor for beginners. A simple explanation of Python basic.

打开index.htm查找全部替换成你的读心术游戏地址即可。采用微信官方小程序开发工具开发，图文全有。

不错的C源码,是关于遥操作服务的,很不错的-good C source code, the distance of operational services, and very good

windows control

利用各种koch曲线生成一个完整的雪花算法-use koch curve generated an algorithm integrity snowflakes

动态规划----矩阵连乘问题 动态规划法是解决问题的一种方法。它不规定为了得到结果需如何将问题划分为子问题的固定方法，而是按不同输入给出问题的具体实例的子问题划分方法，然后再进行运算、解答问题。 矩阵连乘问题的主要思想如下： 1）设置大小为连乘个数的方阵 2）主对角线上方各元素Di,j(ij)记录获得该最小工作量矩阵分组的第一组的最后一个矩阵的序列号 最后通过下方元素可知最终结果的分组方式。-dynamic programming matrix continually multiply-dynamic programming problem is a problem-solving method. It does not require the results need to be how to divide the problems of the sub- problems fixed, but different input given by the specific example of the problem partition method, and then calculate, and answer questions. Matrix continually multiply the main idea is as follows : 1) the installation of the size of continually multiply the number phalanx 2) above the main diagonal elements Di, j (ilt; J) Matrix Mi continually multiply to the smallest workload 3) below elements Di, j (IGT; J) the record was the smallest workload of a matrix of the first group of a matrix of the final sequence, followed by the final element of the final results of the