This is my blog.
西安。2017/9／12。
终于天晴。
在阳光下，写着我的离散。

This is my blog.
（未完待续）
动态规划之树形dp。阅读此文前，需得知道什么是树，二叉树以及三种遍历方式。

This is my blog.
（未完待续）
动态规划中有一分块，便是背包问题。包括01背包，完全背包，多重背包，分组背包等问题。（此文会随着我学习的进度，逐步更新完成）。本文将会讲述如何去做，并附上此类题型的题目（我做过的）。在学习动态规划之时，可以练习noip noi中的题目。

This is my blog.
动态规划问题中，有一类便是求最长上升子序列和最大公共子序列的问题。如何求长度，如何输出序列，如何优化呢！在阅读之中，我将其总结如下。

This is my blog.
背景：In a stroke of luck almost beyond imagination, Farmer John was sent a ticket to the Irish Sweepstakes (really a lottery) for his birthday. This ticket turned out to have only the winning number for the lottery! Farmer John won a fabulous castle in the Irish countryside.
Bragging rights being what they are in Wisconsin, Farmer John wished to tell his cows all about the castle. He wanted to know how many rooms it has and how big the largest room was. In fact, he wants to take out a single wall to make an even bigger room.
Your task is to help Farmer John know the exact room count and sizes.
The castle floorplan is divided into M (wide) by N (1 <=M,N<=50) square modules. Each such module can have between zero and four walls. Castles always have walls on their “outer edges” to keep out the wind and rain.