Submission #88791

#	Time	Username	Problem	Language	Result	Execution time	Memory
88791		asifthegreat	Studentsko (COCI14_studentsko)	C++14	100 / 100	56 ms	1004 KiB

studentsko

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

const int N = 50003;

int ara[N],tmp[N],dp[N],n,k;
vector<int>v;
unordered_map<int,int>id;

int main()
{
    scanf("%d %d",&n,&k);
    for(int i = 0; i < n;i++){scanf("%d",&ara[i]);tmp[i] = ara[i];}
    sort(tmp,tmp+n);
    for(int i = 0; i < n;i++){id[tmp[i]] = i/k;}
    for(int i = 0; i < n;i++)v.push_back(id[ara[i]]);
    dp[0] = 1;
    for(int i = 1; i < n;i++){
        dp[i] = 1;
        for(int j = 0; j < i;j++)
        if(v[j] <= v[i])dp[i] = max(dp[i],dp[j]+1);
    }
    printf("%d\n",n-*max_element(dp,dp+n));
    return 0;
}

Compilation message (stderr)

studentsko.cpp: In function 'int main()':
studentsko.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&k);
     ~~~~~^~~~~~~~~~~~~~~
studentsko.cpp:13:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 0; i < n;i++){scanf("%d",&ara[i]);tmp[i] = ara[i];}
                               ~~~~~^~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10