Cod sursa(job #316638)
Utilizator | Data | 20 mai 2009 16:29:21 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream.h>
int main()
{int max2,j,max,v1[100],v2[100],i,n;
ifstream q("scmax.in");
ofstream w("scmax.out");
q>>n;
for(i=1;i<=n;i++)
q>>v1[i];
for(j=1;j<=n;j++)
{v2[j]=1;
max=v1[j];
for(i=j+1;i<=n;i++)
{if(v1[i]>max)
{v2[i]=v2[i-1]+1;
max=v1[i];}
else
v2[i]=v2[i-1];}
if(max2<v2[n])
max2=v2[n];}
w<<max2;
return 0;} //3