Submission #77137

#	Time	Username	Problem	Language	Result	Execution time	Memory
77137		FiloSanza	Mountains (IOI17_mountains)	C++14	0 / 100	3 ms	528 KiB

mountains

#include "mountains.h"
#include <bits/stdc++.h>
using namespace std;


int maximum_deevs(vector<int> y) {
	int N = (int)y.size();
	vector<int> memo(N, 0);
	memo[N-1] = 1;

	int best = 0;
	int hi;
	for(int i=N-2; i>=0; i--){
		best = 0;
		hi = -1;
		for(int j=i+1; j<N; j++){
			//cout << i << " " << j << " " << hi << " " << y[i] << endl;
			if((y[j] < hi && abs(hi-y[i]) > abs(y[j]-hi)) || (hi > y[i] && y[j] <= hi))					//non lo vede
				best = max(best, memo[j]);
			hi = max(hi, y[j]);
		}
		memo[i] = best+1;
	}

	return *max_element(memo.begin(), memo.end());
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 30
• Subtask 4: 0 / 30