http://poj.org/problem?id=3468/*2391ms,4508KB*/#include #include using namespace std;#define lson l , m , rt << 1#define rson m + 1 , r , rt << 1 | 1#define root 1, N, 1#define LL long l
http://poj.org/problem?id=3368思路:由于序列是非降的,我们可以统计出每个区间的左端点left和右端点right,并用线段树维护区间长度的最大值。记待查询区间[a,b]的a对应的区间为intera,b对应的区间为interb,则当interb==intera时,最大频率为b-a+1;当interb>intera时,最大频率为max(max(right[i
Ubiquitous ReligionsTime Limit: 5000MSMemory Limit: 65536KDescriptionThere are so many different religions in the world today that it is difficult to keep track of them all. You are interest
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号