02 2019 档案

HDU6030 Happy Necklace（递推+矩阵快速幂）
摘要：传送门：点我 Little Q wants to buy a necklace for his girlfriend. Necklaces are single strings composed of multiple red and blue beads. Little Q desperately 阅读全文

posted @ 2019-02-27 17:26 Esquecer 阅读(247) 评论(0) 推荐(0)

矩阵快速幂
摘要：自用 阅读全文

posted @ 2019-02-26 14:12 Esquecer 阅读(136) 评论(0) 推荐(0)

堆优化dij
摘要：#include #include #include using namespace std; int n,m,S,tot,Next[500010],head[20000],tree[500010],val[500010]; bool visit[20000]; long long dis[20000]; struct cmp { bool operator()(int a,int b)... 阅读全文

posted @ 2019-02-24 22:34 Esquecer 阅读(282) 评论(0) 推荐(0)

导航