제출 #436373

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
436373		keta_tsimakuridze	Exam (eJOI20_exam)	C++14	65 / 100	1055 ms	399116 KiB

exam

#include<bits/stdc++.h>
#define f first
#define s second
#define int long long
using namespace std;
const int N=5000+5,M=1e5+5,mod=1e9+7;
int t,mx[N][N],b[M],a[M],dp[N],ans,n,tree[4*M];
map<int,vector<int> > c;
bool ok(int x,int y) {
	if(mx[min(x,y)][max(x,y)] == a[x]) return 1;
	return 0;
}
void update(int u,int ind,int l,int r,int val) {
	if(l>ind || r<ind) return;
	if(l==r) {
		tree[u] = val;
		return;
	}
	int mid=(l+r)/2;
	update(2*u,ind,l,mid,val);
	update(2*u+1,ind,mid+1,r,val);
	tree[u] = max(tree[2*u],tree[2*u+1]);
}
int getans(int u,int start,int end,int l,int r){
	if(l>end || r<start) return 0;
	if(start<=l && r<=end) return tree[u];
	int mid = (l+r)/2;
	return max(getans(2*u,start,end,l,mid),getans(2*u+1,start,end,mid+1,r));
}
 main(){
	cin>>n;
	int F = 0;
	for(int i=1;i<=n;i++) {
		cin >> a[i];
		if(a[i] < a[i-1]) F = 1;
	}
	int f = 0;
	for(int i=1;i<=n;i++){
		cin >> b[i];
		if(i-1 && b[i]!=b[i-1]) f = 1;
	} 
	for(int i=1;i<=n;i++) {
		for(int j=i;j<=n;j++) {
			mx[i][j] = max(mx[i][j-1],a[j]);
		}
	}
	int ans = 0;
	//f = 1;
	if(!f) {
	
		for(int i=1;i<=n;i++){
			int j = i - 1,F = 0;
			while(j<n && a[j+1] <= b[1]) {
				j ++;
				if(b[1]==a[j]) F = 1;
			}
			if(F) ans += j - i + 1;
			i = max(i,j);
		}
		cout<<ans;
		return 0;
	}	
	for(int i=1;i<=n;i++){
		c[a[i]].push_back(i);
	}
	if(!F) { ;
		for(int i=1;i<=n;i++) {
			if(c[b[i]].size() && ok(c[b[i]][0],i)) {
				update(1,c[b[i]][0],1,n,getans(1,1,c[b[i]][0],1,n) + 1);
			}
		}
		cout<<tree[1];
		
		return 0;
	}

	for(int i=1;i<=n;i++) {
		for(int j=c[b[i]].size() - 1;j>=0;j--) {
			int ind = c[b[i]][j];
			dp[ind] = dp[ind] + ok(ind,i);
		}
		for(int j=1;j<=n;j++) {
			dp[j] = max(dp[j],dp[j-1]);
			ans = max(dp[j],ans);
			
		} //cout<<endl;
	}
	cout<<ans;
}

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

exam.cpp:30:2: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   30 |  main(){
      |  ^~~~

• Subtask 1: 14 / 14
• Subtask 2: 0 / 12
• Subtask 3: 13 / 13
• Subtask 4: 0 / 23
• Subtask 5: 16 / 16
• Subtask 6: 22 / 22