Submission #619749

#	Time	Username	Problem	Language	Result	Execution time	Memory
619749		gonzakia29	Financial Report (JOI21_financial)	C++17	0 / 100	121 ms	6960 KiB

Main

#include <iostream>
using namespace std;

int n, d;
int nums[300010];
int dp[300010];
int mini[300000];
int maxi;

int main(){
	cin >> n >> d;
	for (int i = 0; i < n; ++i){
		cin >> nums[i];
		dp[i] = 1;
		mini[i] = 1000000001;
	}
	for (int i = 1; i < n; ++i){
		if (nums[i] > nums[i-1]){
			dp[i] += dp[i-1];
			mini[dp[i]] = min(mini[dp[i]], nums[i]);
			if (nums[i] > mini[dp[i]]){
				dp[i]++;
				mini[dp[i]] = min(mini[dp[i]], nums[i]);
			}
		}
		if (nums[i] == nums[i-1]){
			dp[i] = dp[i-1];
		}
	}
	for (int i = 0; i < n; ++i){
		maxi = max(maxi, dp[i]);
	}
	cout << maxi;
	
}

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