Cod sursa(job #2332101)
Utilizator | Emanuela Bran ema1890 | Data | 30 ianuarie 2019 13:19:24 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,max;
fin>>n;
int k[n], v[n];
for (int i=0; i<n; i++ ) {
fin>>k[i];
v[i]=1;
}
for (int i=1;i<n;i++) {
max=0;
for (int j=0; j<i; j++) {
if (k[j]<k[i] && max<v[j]) {
max=v[j];
}
}
v[i]=max+1;
}
for (int i=0;i<n; i++) {
fout<<k[i]<<" "<<v[i]<<endl;
}
return 0;
}