Submission #234290

#	Time	Username	Problem	Language	Result	Execution time	Memory
234290		Knps4422	Triple Jump (JOI19_jumps)	C++17	5 / 100	9 ms	512 KiB

jumps

//#pragma optimization_level 3
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordset;
*/

#define fr first
#define sc second
#define vec vector
#define pb push_back
#define pii pair<int, int>
#define forn(x,y) for(int x = 1 ; x <= y ; ++x)
#define all(x) (x).begin(),(x).end()
#define fast cin.tie(0);cout.tie(0);cin.sync_with_stdio(0);cout.sync_with_stdio(0);
#define x real
#define y imag

using namespace std;

typedef long long ll;
typedef unsigned int uint;
typedef complex<int> point;
const int nmax = 105, mmax = 80;
const ll linf = 1e18;
const ll mod = 998244353;
const int inf = INT_MAX;

int n, q;
ll a[nmax];
int l , r;
int main(){
	fast;
	cin >> n;
	forn(i,n)cin >> a[i];
	cin >> q;
	forn(ss,q){
		cin >> l >> r;
		ll mx = 0;
		for(int i = l ; i <= r ; i ++)
		for(int j = i + 1 ; j <= r ; j++)
		for(int k = j + 1 ; k <= r ; k++){
			if(j-i <= k-j){
				mx = max(mx,a[i] + a[j] + a[k]);
			}
		}
		cout << mx << '\n';
	}

}

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