Cod sursa(job #785717)
Utilizator | Data | 9 septembrie 2012 18:56:19 | |
---|---|---|---|
Problema | Cel mai lung subsir comun | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
int lis(int v[], int n)
{
int *best = new int [n];
for(int i = 0; i < n; i++)
best[i] = 1;
for(int i = 0; i < n; i++)
for(int j = 0; j < i; j++)
if(v[j] < v[i])
best[i] = 1 + best[j];
return best[n - 1];
}
int main()
{
int n;
int *v;
ifstream f("scmax.in");
ofstream g("scmax.out");
f >> n;
v = new int [n];
for(int i = 0; i < n; i++)
f >> v[i];
g << lis(v, n);
}