HPU Summer Day 16(河南理工大学暑期第十六天)

今天主要学习了矩阵快速幂的计算以及相关问题的解决方法。题还是挺好写的，矩阵快速幂也挺好理解的，实在不行的话记模板也不错。

HPU Summer Training Day 9（河南理工大学暑期第九天）

今天主要讲了树的直径，是用bfs和dfs实现的，但是我的dfs，emm，一言难尽，所以我只用了bfs。

Greedy-dating Ⅱ

A basic greedy problem.

LIS

51nod is good.

Edit distance

I started to learn "Edit distance" though I still can't understand "LCS" enough.We will always encounter some trenches that cannot be crossed. At this time, we need to go around and wait until we are strong enough to solve this problem. This will never be the reason for us to stop.

LCS

DP is too difficult for me.