Pagini recente » Cod sursa (job #3123219) | Cod sursa (job #2000538) | Cod sursa (job #2271373) | Cod sursa (job #2030699) | Cod sursa (job #358638)
Cod sursa(job #358638)
#include <fstream.h>
#include <conio.h>
#include <iostream.h>
int k,n,j,pus,i,v[1000], sub[1000], up[1000];
int main(){
ifstream fin("subsir.in");
ofstream fout("subsir.out");
fin>>n;
k=1; up[k]=0;
for(i=0; i<n; i++)
fin>>v[i];
for(i=0; i<n; i++){
pus=0;
for(j=1; (j<=k && pus==0); j++){
if(v[i]>up[j]){
up[j]=v[i];
pus=1;
sub[i]=j;
}
}
if(pus==0){
k++;
up[k]=v[i];
sub[i]=k;
}
}
for(i=0; i<n; i++)
cout<<" "<<v[i];
cout<<endl;
for(i=0; i<n; i++)
cout<<" "<<sub[i];
cout<<endl;
for(i=1; i<=k; i++)
cout<<" "<<up[i];
cout<<endl;
for(i=0; i<=k; i++){
for(j=0; j<n; j++){
if(sub[j]==i+1){
cout<<j+1<<" ";
}
}
cout<<endl;
}
return 0;
}