제출 #479347

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
479347		nicolaalexandra	Financial Report (JOI21_financial)	C++14	0 / 100	4089 ms	2968 KiB

Main

#include <bits/stdc++.h>
#define DIM 300010
using namespace std;

pair <int,int> v[DIM];
int dp[DIM];
int n,d,i,j;

inline int cmp (pair<int,int> a, pair<int,int> b){
    if (a.first == b.first)
        return a.second > b.second;
    return a.first < b.first;
}

int main (){

    //ifstream cin ("date.in");
    //ofstream cout ("date.out");

    cin>>n>>d;
    for (i=1;i<=n;i++){
        cin>>v[i].first;
        v[i].second = i;
    }

    sort (v+1,v+n+1,cmp);

    dp[1] = 1;
    for (i=2;i<=n;i++){
        dp[i] = 1;
        for (j=1;j<i;j++){
            if (v[j].second < v[i].second && v[j].second + d >= v[i].second)
                dp[i] = max (dp[i],dp[j]+1);
        }
    }

    int sol = 0;
    for (i=1;i<=n;i++)
        if (v[i].second + d >= n)
            sol = max (sol,dp[i]);
    cout<<sol;

    return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 20
• Subtask 4: 0 / 12
• Subtask 5: 0 / 5
• Subtask 6: 0 / 35