HDU 6601 [2019 Multi-University Training Contest 2]

Keen On Everything But Triangle

Problem Description

N sticks are arranged in a row, and their lengths are a1,a2,…,aN.

There are Q querys. For i-th of them, you can only use sticks between li-th to ri-th. Please output the maximum circumference of all the triangles that you can make with these sticks, or print −1 denoting no triangles you can make.

Input

There are multiple test cases.

Each case starts with a line containing two positive integers N,Q(N,Q≤105).

The second line contains N integers, the i-th integer ai(1≤ai≤109) of them showing the length of the i-th stick.

Then follow Q lines. i-th of them contains two integers li,ri(1≤li≤ri≤N), meaning that you can only use sticks between li-th to ri-th.

It is guaranteed that the sum of Ns and the sum of Qs in all test cases are both no larger than 4×105.

Output

For each test case, output Q lines, each containing an integer denoting the maximum circumference.

Sample Input

5 3
2 5 6 5 2
1 3
2 4
2 5

Sample Output

13
16
16

思路

题目意思是说，给出n个数，让你从所给的区间中找出能构成三角形的三个数的周长最大值。找区间内的最大的三个数，不能凑成三角形就往下推一个位，因为斐波那契数列是最极限不能构成三角形的数据，第49个斐波那契数已经超出题目给的10⁹范围。所以最多跑49次一定可以得到结果。区间第k大问题，没学过主席树，套了一个区间第k小的模板，反向求最大。最后因为输出那里不是long long类型WA了好久……

代码

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MAXN = 100010;
const int M = MAXN * 30;
int n,q,m,tot;
int a[MAXN], t[MAXN];
int T[MAXN], lson[M], rson[M], c[M];
void Init_hash() {
	for(int i = 1; i <= n; i++)
		t[i] = a[i];
	sort(t+1,t+1+n);
	m = unique(t+1,t+1+n)-t-1;
}
int build(int l,int r) {
	int root = tot++;
	c[root] = 0;
	if(l != r) {
		int mid = (l+r)>>1;
		lson[root] = build(l,mid);
		rson[root] = build(mid+1,r);
	}
	return root;
}
int hashh(int x) {
	return lower_bound(t+1,t+1+m,x) - t;
}
int update(int root,int pos,int val) {
	int newroot = tot++, tmp = newroot;
	c[newroot] = c[root] + val;
	int l = 1, r = m;
	while(l < r) {
		int mid = (l+r)>>1;
		if(pos <= mid) {
			lson[newroot] = tot++;
			rson[newroot] = rson[root];
			newroot = lson[newroot];
			root = lson[root];
			r = mid;
		} else {
			rson[newroot] = tot++;
			lson[newroot] = lson[root];
			newroot = rson[newroot];
			root = rson[root];
			l = mid+1;
		}
		c[newroot] = c[root] + val;
	}
	return tmp;
}
int query(int left_root,int right_root,int k) {
	int l = 1, r = m;
	while( l < r) {
		int mid = (l+r)>>1;
		if(c[lson[left_root]]-c[lson[right_root]] >= k ) {
			r = mid;
			left_root = lson[left_root];
			right_root = lson[right_root];
		} else {
			l = mid + 1;
			k -= c[lson[left_root]] - c[lson[right_root]];
			left_root = rson[left_root];
			right_root = rson[right_root];
		}
	}
	return l;
}
int main() {
	while(scanf("%d%d",&n,&q) != EOF) {
		tot = 0;
		for(int i = 1; i <= n; i++)
			scanf("%d",&a[i]);
		Init_hash();
		T[n+1] = build(1,m);
		for(int i = n; i ; i--) {
			int pos = hashh(a[i]);
			T[i] = update(T[i+1],pos,1);
		}
		while(q--) {
			int l,r;
			bool flag = false;
			scanf("%d%d",&l,&r);
			for(int i=0; i<=r-l-2; i++) {
				if(t[query(T[l], T[r + 1], r-l+1-i)] < t[query(T[l], T[r + 1], r-l-i)] + t[query(T[l], T[r + 1], r-l-1-i)]) {
					cout << 1ll * t[query(T[l], T[r + 1], r-l+1-i)] + 1ll * t[query(T[l], T[r + 1], r-l-i)] + 1ll * t[query(T[l], T[r + 1], r-l-1-i)] << endl;;
					flag = true;
					break;
				}
			}
			if(!flag) {
				puts("-1");
			}
		}
	}
	return 0;
}

题目来源

HDU 6601 Keen On Everything But Triangle