BZOJ2151 种树 贪心+双向链表+优先队列
#include#define LL long long#define clr(x,i) memset(x,i,sizeof(x))#define mp make_pair#define pii pairusing namespace std;const int N=200005;int n,m,a[N],nex[N],pre[N],ans,vist[N];priority_que
原创
2017-12-05 20:59:02 ·
359 阅读 ·
0 评论