- 博客(2)
- 收藏
- 关注
RSS订阅原创 BZOJ 1050 [HAOI2006]旅行comf
动点spfa，并不知道复杂度多少。#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<cmath>#include<vector>#include<queue>using namespace std;const int maxn = 1001050;int dist[maxn]
2017-04-20 09:58:57
377
原创 BZOJ 4129 Haruna’s Breakfast
同糖果公园，直接树分块套带修莫队即可。#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#include<vector>#include<cmath>using namespace std;const int maxn = 505000;vector<int> f[maxn],g[maxn];
2017-04-20 09:54:56
363
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人