Cod sursa(job #3293008)
Utilizator | Data | 10 aprilie 2025 08:41:39 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int main()
{
int n; cin>>n;
vector<ll> arr(n+1);
for(int i=1;i<=n;i++)
cin>>arr[i];
vector<int> dp(n+1);
vector<ll> prev;
dp[0]=0;
dp[1]=0;
for(int i=1;i<=n;i++){
if(arr[i]>arr[i-1]){
dp[i]=dp[i-1]+1;
prev.push_back(arr[i-1]);
}
else
dp[i]=max(dp[i], dp[i-1]);
}
/**
for(int i=1;i<=n;i++)
cout<<dp[i]<<" ";
cout<<endl;
**/
/**
for(auto it:prev)
cout<<it<<" ";
**/
cout<<dp[n];
}