Cod sursa(job #2449008)
Utilizator | Dragos Chileban Dragos1226 | Data | 17 august 2019 19:51:59 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int n, v[100001], s[100001], pred[1000001], m;
int main() {
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
for(int i=1;i<=n;i++) {
m=0;
for(int j=1;j<i;j++)
if(v[j]<v[i] && s[j]>m)
{m=s[j];pred[i]=j;}
s[i]=m+1;
}
int j;
for(int i=1;i<=n;i++)
if(s[i]>m) {
m=s[i];
j=i;
}
int k=j;
n=1;
out<<m<<'\n';
for(int i=1;i<m;i++) {
s[n++]=pred[j];
j=pred[j];
}
for(int i=n-1;i>=1;i--)
out<<s[i]<<" ";
out<<k;
}