Cod sursa(job #538991)
| Utilizator | Data | 22 februarie 2011 10:21:30 | |
|---|---|---|---|
| Problema | Subsir 2 | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include<fstream>
using namespace std;
int main()
{int sir[25],max[25];
int n,i,maxi,subsir=0,d,k;
ifstream f1("subsir2.in");
ofstream f2("subsir2.out");
f1>>n;
for(i=1;i<=n;i++)
{f1>>sir[i];
max[i]=0;
}
max[1]=1;
for(i=2;i<=n;i++)
{maxi=0;
for(d=1;d<i;d++)
{if((sir[i]>sir[d])&&(max[d]>maxi)) maxi=max[d];
}
maxi++;
max[i]=maxi;
if(subsir<maxi) subsir=maxi;
}
f2<<subsir<<endl;
k=0;
for(i=n;i>=1;i--)
{if(max[i]==subsir-k)
{f2<<i<<" ";
k++;
}
}
return 0;
}
