oj.uz

답안 #293680

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
293680 2020-09-08T09:45:23 Z tinjyu Mountains (IOI17_mountains) C++14
0 / 100
 1 ms 384 KB 
#include "mountains.h"
#include <vector>
#include <iostream>
using namespace std;
long long int dp[2005][2005],n;
int maximum_deevs(std::vector<int> y) {
	n=y.size();
	for(int i=0;i<n;i++)dp[i][i]=1;
	for(int len=2;len<=n;len++)
	{
		for(int i=0;i<n;i++)
		{
			if(i+len-1>=n)break;
			int r=i+len-1;
			dp[i][r]=max(dp[i][r-1],dp[i+1][r]);
			long long int p=0,ma=0;
			for(int j=i;j<i+len;j++)
			{
				if(y[j]>ma)
				{
					ma=y[j];
					p=j;
				}
			}
			dp[i][r]=max(dp[i][p-1]+dp[p+1][r],dp[i][r]);
			//cout<<i<<" "<<r<<" "<<dp[i][r]<<endl;
		}
	}
	return dp[0][n-1];
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 30.0

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

Subtask #4
0 / 30.0

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