oj.uz

답안 #905287

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
905287 2024-01-12T22:23:29 Z rainboy Mountains (IOI17_mountains) C++17
0 / 100
 1 ms 348 KB 
#include "mountains.h"
#include <vector>

using namespace std;

typedef vector<int> vi;

const int N = 2000;

int max(int a, int b) { return a > b ? a : b; }

long long cross(int x0, int y0, int x1, int y1, int x2, int y2) {
	return (long long) (x1 - x0) * (y2 - y0) - (x2 - x0) * (y1 - y0);
}

int dp[N][N];

int maximum_deevs(vi yy) {
	int n = yy.size();
	for (int i = n - 1; i >= 0; i--) {
		dp[i][i] = 1;
		int k = i, x = 0;
		for (int j = i + 1; j < n; j++) {
			dp[i][j] = dp[i + 1][j];
			if (cross(i, yy[i], k, yy[k], j, yy[j]) >= 0) {
				if (j - k > 1)
					x += dp[k + 1][j - 1];
				k = j;
				dp[i][j] = max(dp[i][j], x + 1);
			} else
				dp[i][j] = max(dp[i][j], x + dp[k + 1][j] + 1);
		}
	}
	return dp[0][n - 1];
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -