These STL in c++ are so useful that you can sovle some problems easily through use them.I have known map,vector,queue,stack,set.And there is a STL named bitset.

The game I played in the NOWCODER.COM a few days ago, the first time I met the “union-find” problem, it was solved with the help of the seniors. I have digested it in the past few days, or I wrote it on the blog first.

又是一道不涉及算法，偏重于思维的水题诶。妥妥的签到，虽然我也没有自己成功的做出来。

最近学长开的算法课中了解到了优先队列，又正好在白书上看到一道可以用优先队列实现的题，磕了小半天，终于是在白书的帮助下AC啦。🌞

蒟蒻的HDU刷（shui）题之旅