제출 #975249

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
975249		LCJLY	Financial Report (JOI21_financial)	C++14	12 / 100	30 ms	8000 KiB

Main

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

#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<long long,long long>pii;
typedef pair<int,pii>pi2;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

void solve(){
	int n,k;
	cin >> n >> k;
	int arr[n];
	for(int x=0;x<n;x++){
		cin >> arr[x];
	}
	
	int best=1;
	deque<int>d;
	for(int x=n-1;x>=0;x--){
		while(!d.empty()&&arr[d.back()]<=arr[x]) d.pop_back();
		d.push_back(x);
		best=max(best,(int)d.size());
	}
	cout << best;
}
 
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
	//freopen("in.txt","r",stdin);
	//cin >> t;
	while(t--){
		solve();
	}
}

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