Cod sursa(job #3293052)
Utilizator | Data | 10 aprilie 2025 10:50:08 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 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(n+1);
unordered_multiset<ll> s;
dp[0]=0;
dp[1]=0;
int last=arr[1];
for(int i=1;i<=n;i++){
dp[i]=1;
for(int j=1;j<=i;j++)
if(arr[j]<arr[i]){
dp[i]=max(dp[i], dp[j]+1);
prev[i]=j;
}
}
}