Submission #638859

#	Time	Username	Problem	Language	Result	Execution time	Memory
638859		Pietra	Financial Report (JOI21_financial)	C++14	0 / 100	188 ms	5764 KiB

Main

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

const int maxn = 3e5 + 5 ; 

int n, mx[maxn], d, v[maxn] ; 

int main(){

	cin >> n >> d ; 

	for(int i = 1 ; i <= n ; i++) cin >> v[i] ; 

	for(int i = 1 ; i <= n + 1 ; i++) mx[i] = max(mx[i-1], v[i-1]) ; 

	int att = 0, ans = 0 ; 

	for(int i = n - 1 ; i > 0 ; i--){
		att += (v[i] > mx[i]) ; ans = max(ans, att+1) ; 
	}

	cout << ans << "\n" ; 

}

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