Add a new example: longest increasing subsequence

It is a simple dynamic programming
better test cases

a test cases generator in Java and a larger group of test cases
Apply the rapid matrix multiplication algorithm

1. The introduction is http://en.wikipedia.org/wiki/Strassen_algorithm,

2. file discription:
Generator.java:  new test cases generator
*.in: new test cases by Generator.java, suitable for both normal mul and
rapid mul,

3. usage:
normal mul: matrix large.in
rapid mul: matrix large.in fast
Merge pull request #11 from beenshi/master

Add a new example of "longest increasing subsequence"