Cod sursa(job #3311173)
| Utilizator | Data | 20 septembrie 2025 10:35:23 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int main(){
int n; fin >> n;
vector<int> v(n), d(n, 1);
for (int& num : v) fin >> num;
for (int i = 1; i < n; i++){
for (int j = 0; j < i; j++){
if (v[i] > v[j]) d[i] = max (d[i], d[j]+1);
}
}
fout << ({int maxim = 1; for (int& num : v) maxim = max(maxim, num); maxim;});
for (int i = 0; i < n; i++) fout << " 0";
return 0;
}
