Pagini recente » Cod sursa (job #3327090) | Cod sursa (job #1719618) | Cod sursa (job #1733913) | Cod sursa (job #2026508) | Cod sursa (job #3308660)
#include <fstream>
#include <vector>
using namespace std;
const int Nmax = 100005;
int n, v[Nmax], dp[Nmax];
// dp[i] = secv str cresc de lungime maxima care se termina in a[i]
int main(){
ifstream fin("scmax.in");
ofstream fout("scmax.out");
fin >>n;
for(int i = 1; i <= n; i++){
fin >> v[i];
}
int sol = 1;
dp[1] = 1;
for(int i = 2; i <= n; i++){
int maxi = 0;
for(int j = 1; j < i; j++){
if(v[j] < v[i]){
maxi = max(maxi, dp[j]);
}
}
dp[i] = maxi+1;
sol = max(sol, dp[i]);
}
fout << sol;
return 0;
}