oj.uz

답안 #126017

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
126017 2019-07-06T18:06:57 Z zeyad49 Mountains (IOI17_mountains) C++17
0 / 100
 2 ms 376 KB 
#include "mountains.h"
#define x first
#define y second
using namespace std;
typedef pair<int,int> point;
const int MAX = 2005;
int dp[MAX][MAX];
point p[MAX];
long long ccw(point a, point b, point c)
{
	return (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x);
}
int maximum_deevs(vector<int> y)
{
	int n = y.size();
	for (int i = 0; i < n; i++)
	{
		p[i].y = y[i];
		p[i].x = i;
	}
	for (int r = 1; r <= n; r++)
	{
		int sum = 0, last = r - 1;
		
		dp[r - 1][r] = 1;
		for (int l = r - 2; l >= 0; l--)
		{
			dp[l][r] = dp[l][r - 1];
			if (ccw(p[l], p[last], p[r - 1]) >= 0)
			{
				sum += dp[l + 1][last];
				last = l;
			}
			dp[l][r] = max(dp[l][r], 1 + sum + dp[l][last]);
		}
	}
	return dp[0][n];
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 30.0

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

Subtask #4
0 / 30.0

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