Cod sursa(job #2955854)
Utilizator | Data | 17 decembrie 2022 23:03:05 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 65 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n;
vector<long long> ans;
int v[100005];
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
int x;
f>>v[i];
}
ans.push_back(v[1]);
for(int i=2;i<=n;i++)
{
if(v[i] > ans[ans.size()-1])
ans.push_back(v[i]);
else
{
auto it = lower_bound(ans.begin(),ans.end(),v[i]);
*it = v[i];
}
}
g<<ans.size()<<"\n";
for(int i=0;i<ans.size();i++)
g<<ans[i]<<" ";
}