oj.uz

Submission #89384

# Submission time Handle Problem Language Result Execution time Memory
89384 2018-12-12T18:58:11 Z alipasha Studentsko (COCI14_studentsko) C++14
100 / 100
 51 ms 944 KB 
#include<bits/stdc++.h>

using namespace std;

int test;
int n;
int k;
int dp[5005];
pair<int,int> B[5005];
int A[5005];
int main(){
    cin >> n;
    cin >> k;
    for(int i=0; i<n; i++)
    {
        int v;
        cin >> v;
        B[i]={v,i};
    }
    sort(B,B+n);
    int group=0;
    int cnt=0;
    for(int i=0; i<n; i++)
    {
        A[B[i].second]=group;
        cnt++;
        if(cnt==k)
        {
            cnt=0;
            group++;
        }
    }

    dp[0]=1;
    int maxi;
    int ans=0;
    for(int i=1; i<n; i++)
    {
        maxi=i;
        for(int j=0; j<i; j++)
        {
            if(A[j]<=A[i] && dp[j]>dp[maxi])
            {
                maxi=j;
            }
        }
        dp[i]=dp[maxi]+1;
        ans=max(ans,dp[i]);
    }
    cout << n-ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 512 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 616 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 652 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 652 KB Output is correct
2 Correct 41 ms 848 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 848 KB Output is correct
2 Correct 50 ms 848 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 848 KB Output is correct
2 Correct 30 ms 848 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 896 KB Output is correct
2 Correct 48 ms 896 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 896 KB Output is correct
2 Correct 50 ms 944 KB Output is correct