oj.uz

Submission #941677

# Submission time Handle Problem Language Result Execution time Memory
941677 2024-03-09T09:40:11 Z PlayVoltz Triple Jump (JOI19_jumps) C++17
0 / 100
 15 ms 1884 KB 
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
using namespace std;

#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, q, a, b;
	cin>>n;
	vector<int> vect(n+1);
	for (int i=1; i<=n; ++i)cin>>vect[i];
	cin>>q;
	while (q--){
		cin>>a>>b;
		int res=0;
		for (int i=b, j=b, p=b, best=0, mx=0; i>=a; --i){
			best=0;
			while (j>i){
				while (p>=2*j-i)mx=max(mx, vect[p]), --p;
				best=max(best, vect[j]+mx);
				--j;
			}
			res=max(res, vect[i]+best);
		}
		cout<<res<<"\n";
	}
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 1884 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -