Submission #446753

#	Time	Username	Problem	Language	Result	Execution time	Memory
446753		zxcvbnm	Mountains (IOI17_mountains)	C++14	0 / 100	1 ms	204 KiB

mountains

#include "mountains.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> a;
bool can(int i, int j) {
	double slope = a[i] == a[j] ? 0 : (i-j) / (a[i]-a[j]);
	double curr = a[i];
	for(int k = i+1; k < j; k++) {
		curr += slope;
		if ((double) a[k] > curr) {
			return true;
		}
	}
	return false;
}
int maximum_deevs(std::vector<int> y) {
	int n = y.size();
	a = y;
	vector<int> dp(n+1, 1);
	for(int i = 0; i < n; i++) {
		for(int j = i+1; j < n; j++) {
			if (can(i, j)) {
				dp[j] = max(dp[j], dp[i]+1);
			}
		}
	}
//	for(int i : dp) {
//		cout << i << " ";
//	}
	return *max_element(dp.begin(), dp.end());
}

//int main() {
//
//}

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