acm
文章平均质量分 55
Srgggggg
这个作者很懒,什么都没留下…
展开
-
hdu 2442
#include #include #include using namespace std; int main(int argc, const char * argv[]) { int cas,n,m,t; priority_queue,greater >Q0; priority_queue,less >Q1; int tmp_arr[2001],arr[2001]; cin原创 2012-11-01 20:14:00 · 461 阅读 · 0 评论 -
hdu 1442
题意:有两种操作,add(x),get() The Black Box algorithm supposes that natural number sequence u(1), u(2), ..., u(N) is sorted in non-descending order, N <= M and for each p (1 <= p <= N) an inequality p <= u(p原创 2012-11-01 19:20:23 · 328 阅读 · 0 评论