Pagini recente » Cod sursa (job #1331254) | Cod sursa (job #1170880) | Cod sursa (job #814865) | Cod sursa (job #1449552) | Cod sursa (job #2177397)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("subsir2.in");
ofstream fout("subsir2.out");
int A[100], B[100], C[100], D[100], i,p,n,j;
int main(){
fin>>n;
for (i=1; i<=n; i++){
fin>>A[i];
}
C[n]=1;
D[n]=0;
for (i=n-1; i>=1; i--)
{
p=i;
C[i]=0;
for(j=i+1; j<=n; j++)
{
if ((A[i]<A[j]) && (C[j]>C[p]))
p=j;
}
C[i]=C[p]+1;
if(p!=i){
D[i]=p;
}
else D[i]=0;
}
p=n;
for (i=n-1; i>=1; i--)
if(C[i]>C[p]) p=i;
fout<<C[p]<<endl;
fout<<A[p]<<" ";
p=D[p];
while (p) {
fout<<C[p]<<" ";
fout<<D[p]<<" ";
p=D[p];
}
}