Pagini recente » Cod sursa (job #2261940) | Cod sursa (job #223774) | Cod sursa (job #2049544) | Istoria paginii algoritmiada-2019/runda-maraton/solutii/palatulvoltaic | Cod sursa (job #576467)
Cod sursa(job #576467)
#include <fstream>
using namespace std;
ifstream fin("sir.in");
ofstream fout("sir.out");
int main()
{
int a[100], i, j, L[100], n;
fin >> n;
for ( i = 0; i < n; i++ )
fin >> a[i];
for ( i = 0; i < n; i++ )
{
L[i] = 1;
for ( j = 0; j < i; j++ )
if ( L[j] + 1 > L[i] && a[i] > a[j] )
L[i] = L[j] + 1;
}
fout << L[n-1] << '\n';
fin.close();
fout.close();
return 0;
}