Cod sursa(job #693920)
| Utilizator | Data | 27 februarie 2012 17:43:17 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,v[100003],i,loc[100003],j;
void citire()
{
f >> n;
for(i=1;i<=n;i++)
f >> v[i];
}
void locul()
{
int max=0;
loc[n]=1;
for(i=n;i>=1;i--)
for(j=i-1;j>=1;j--)
{
if(v[j]<v[i])
loc[j]=loc[i]+1;
if(loc[j]>max)
max=loc[j];
}
g << max << "\n";
}
int main()
{
citire();
locul();
return 0;
}