oj.uz

답안 #729880

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
729880 2023-04-24T18:43:11 Z NintsiChkhaidze Money (IZhO17_money) C++17
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
#define pb push_back
#define tree int h,int l,int r
#define left (h<<1),l,(l+r)>>1
#define right ((h<<1)|1),((l+r)>>1) + 1,r
#define f first
#define s second
#define ll long long
using namespace std;

const int N = 1e6 + 5;
int a[N],fen[N];

void upd(int idx){
	while (idx <= 1000000){
		fen[idx] += 1;
		idx += (idx & (-idx));
	}
}
int get(int idx){
	int s = 0;
	while (idx){
		s += fen[idx];
		idx -= (idx & (-idx));
	}
	return s;
}
signed main (){
	ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
	
	int n;
	cin>>n;
	for (int i = 1; i <= n; i++)
		cin>>a[i];
		
	int l = 1,ans=0;
	while (l <= n){
		int r = l,mn = a[l],mx = a[l];
		while (r + 1 <= n){
			if (a[r + 1] < a[r]) break;
			int mn1 = min(mn,a[r + 1]),mx1 = max(mx,a[r + 1]);
			if (get(mx1) - get(mn1 - 1) > 0) break;
			r++;
		}
		for (int i = l; i <= r; i++) upd(a[i]);
		l = r + 1;
		++ans;
	}
	cout<<ans;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Incorrect 1 ms 328 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Incorrect 1 ms 328 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Incorrect 1 ms 328 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Incorrect 1 ms 328 KB Output isn't correct
5 Halted 0 ms 0 KB -