Submission #989969

#	Time	Username	Problem	Language	Result	Execution time	Memory
989969		Acanikolic	Triple Jump (JOI19_jumps)	C++14	0 / 100	4008 ms	3672 KiB

jumps

#include <bits/stdc++.h>  

#define int long long 

#define pb push_back
 
#define F first
 
#define S second
 
using namespace std;
 
const long long N = 3e5 + 10;
 
const long long mod = 998244353;
 
const long long inf = 1e9;
 
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
 
	int n;
	cin >> n;
	vector<int>a(n + 1);
	for(int i = 1; i <= n; i++) cin >> a[i];
	int q;
	cin >> q;
	while(q--) {
		int l,r;
		cin >> l >> r;
		int res = 0,mx = 0;
		for(int i = l; i <= r; i++) mx = max(mx,a[i]);
		for(int i = l; i <= r; i++) {
			for(int j = i + 1; j <= r; j++) {
				for(int k = j + j - i; k <= r; k++) {
					res = max(res,a[i] + a[j] + a[k]);
				}
			}
		}
		bool have = false;
		for(int i = l; i <= r; i++) {
			for(int j = i + 1; j <= r; j++) {
				for(int k = j + j - i; k <= r; k++) {
					res = max(res,a[i] + a[j] + a[k]);
					if(a[i] + a[j] + a[k] == res  && max(a[i],max(a[j],a[k])) == mx) have = true;
				}
			}
		}
		assert(have);
		cout << res << "\n";
	}
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 14
• Subtask 3: 0 / 27
• Subtask 4: 0 / 54