摘要:
https://www.luogu.org/problem/show?pid=1339Dijkstra最短路#include#include#include#include#include#include#includeusing namespace std;int w[2501]... 阅读全文
posted @ 2017-03-17 17:22
primes
阅读(208)
评论(0)
推荐(0)
摘要:
https://www.luogu.org/problem/show?pid=1801#sub用对顶堆来做: 上次输出第s小的数,在大根堆里储存s数(这个状态需要维护),在小根堆里存剩下的数,下一次输出时输出小根堆的顶,即是需要输出的值,s++#include#include#in... 阅读全文
posted @ 2017-03-17 16:28
primes
阅读(146)
评论(0)
推荐(0)
摘要:
#include#include#include#include#include#include#include using namespace std;int n,m,ans=0;struct H{ int p,a;}milk[5009];int my_comp(const... 阅读全文
posted @ 2017-03-17 15:12
primes
阅读(176)
评论(0)
推荐(0)
摘要:
https://www.luogu.org/record/lists?pid=P1204维护区间#include#include#include#include#include#include#include using namespace std;int n,max1=0,max... 阅读全文
posted @ 2017-03-17 15:05
primes
阅读(229)
评论(0)
推荐(0)

浙公网安备 33010602011771号