제출 #1129686

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1129686		zhasyn	Money (IZhO17_money)	C++20	45 / 100	74 ms	1584 KiB

money

#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
#define F first
#define S second
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 3 * 1e5 + 100, M = 500 + 10, len = 315, inf = 1e18;
const ll mod = 998244353;
ll um(ll a, ll b){
	return (1LL * a * b) % mod;
}
ll subr(ll a, ll b){
	return ((1LL * a - b) % mod + mod) % mod;
}
ll bp(ll x, ll step){
	ll res = 1;
	while(step){
		if(step & 1) res = um(res, x);
		x = um(x, x);
		step /= 2;
	}
	return res;
}
ll inv(ll x){
	return bp(x, mod - 2);
}
int a[N];
int main() {
	//ios_base::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);
	int n;
	cin >> n;
	set <int> st;
	st.insert(0);
	st.insert(INT_MAX);
	int prev = 0, ans = 0, to = INT_MAX;
	for(int i = 0; i < n; i++){
		cin >> a[i];
		if(a[i] < prev || a[i] > to){
			//cout << a[i] << endl;
			ans++;
			auto k = st.upper_bound(a[i]);
			to = *k;
		}
		prev = a[i];
		st.insert(a[i]);
		//cout << a[i] << " "<< prev << " " << to << endl;
	}
	cout << ans + 1;
  return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 20 / 20
• Subtask 4: 0 / 55