제출 #210863

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
210863		tleontest1	학생 (COCI14_studentsko)	C++14	100 / 100	18 ms	892 KiB

studentsko

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< int,int > PII;

#define fi first
#define int long long
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 5002;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t;
int cev;
string s;
map<int,int> mpp;
vector<int> v;

inline int LIS(){
	int len=1;
	b[1]=mpp[a[1]];
	for(int i=2;i<=n;i++){
		if(mpp[a[i]]<b[1])b[1]=mpp[a[i]];
		else if(mpp[a[i]]>=b[len])b[++len]=mpp[a[i]];
		else{
			int bas=1;
			int son=len;
			while(bas<=son){
				if(b[ort]>mpp[a[i]])son=ort-1;
				else bas=ort+1;
			}
			b[bas]=mpp[a[i]];
		}
	}
	return len;
}

main(void){
	//~ memset(dp,-1,sizeof(dp));
	scanf("%lld %lld",&n,&m);
	FOR{
		scanf("%lld",&a[i]);
		b[i]=a[i];
	}
	sort(b+1,b+n+1);
	FOR{
		mpp[b[i]]=(i-1)/m+1;
	}
	
	printf("%lld\n",n-LIS());
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

studentsko.cpp:55:10: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(void){
          ^
studentsko.cpp: In function 'int main()':
studentsko.cpp:57:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~~~~~
studentsko.cpp:59:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&a[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