Pagini recente » Cod sursa (job #2354545) | Cod sursa (job #2115844) | Cod sursa (job #2090465) | Cod sursa (job #1391519) | Cod sursa (job #1529731)
#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int maxim[100005];
int main()
{
int x[100005] , i , n ;
fin >> n;
for(i = 1 ; i <= n ; i++)
{
fin >> x[i];
maxim[i] = 1;
}
for(i = 1 ; i <= n ; i++){
for(int j = 1 ; j < i ; j++){
if(x[i] > x[j]){
if(maxim[j] + 1 > maxim[i])
{
maxim[i] = maxim[j] + 1;
}
}
}
}
for(i = 1 ; i <= n ; i++) fout << maxim[i] << " ";
fout << endl;
sort(maxim , maxim + n + 1);
fout << maxim[n];
}