제출 #321162

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
321162		monkey8	Mountains (IOI17_mountains)	C++14	100 / 100	39 ms	14352 KiB

mountains

#include "mountains.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <cstdio>
#include <utility> 
#include <queue>
#include <math.h>
#include <set>
#include <bitset>
#include <cmath>
#include <bitset>
#include <stack>
#include <cstring>
#include <deque>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAXN = 2010;
int dp[MAXN][MAXN];

int maximum_deevs(vector<int> y) {
    int n = y.size();
    dp[0][0] = 1;
    int prev = -1;
    double curr = -1e9;
    for(int i = 1; i < n; i++) {
        for(int j = i; j >= 0; j--) {
            if(i == j) {
                curr = -1e9;
                dp[j][i] = 1;
                prev = i;
                continue;
            }
            dp[j][i] = dp[j][i - 1];
            double slope = (double)(y[j] - y[i])/(double)(i - j);
            if(slope >= curr) {
                dp[j][i] = max(dp[j][i], dp[j + 1][i]);
                curr = slope;
                prev = j;
            }
            else dp[j][i] = max(dp[j][i], dp[j][prev - 1] + dp[prev + 1][i]);
        }
    }
    return dp[0][n - 1];
}

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