线段树
文章平均质量分 93
oilover
NOIP2010三等,NOIP2011三等,2013年杭州赛区打铁,2014年广州赛区打铁,这么多年过去了,我还是这么垃圾!!!!!!!
展开
-
HDU 4747 Mex (线段树)
#include #include #include #include using namespace std; #define ll long long #define prt(k) cerr<<#k" = "<<k<<endl const int N = 200014; const int Lim = 200000; #define lson l,m,o*2 #define rson m+原创 2014-11-19 17:08:50 · 1287 阅读 · 0 评论 -
ZOJ 3349 Special Subsequence(线段树优化DP)
There a sequence S with n integers , and A is a special subsequence that satisfies |Ai-Ai-1| d ( 0 Now your task is to find the longest special subsequence of a certain sequence S Input There ar原创 2014-02-25 10:55:42 · 962 阅读 · 0 评论