Cod sursa(job #2675904)
Utilizator | Sontea Vladimir Menelaus | Data | 22 noiembrie 2020 20:14:46 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.22 kb |
#include <iostream>
#include <fstream>
#include <vector>
std::ifstream in("scmax.in");
std::ofstream out("scmax.out");
const int N=100001;
int v[N];
std::pair<int, int> scmax(int n)
{
std::vector<int> lis(n+1, 0);
int l=1, index=1;
lis[1]=v[1];
for(int i=2; i<=n; i++)
{
if(v[i]<lis[1])
{
lis[1]=v[i];
}
else
{
if(v[i]>lis[l])
{
lis[++l]=v[i];
index=i;
}
else
{
{
int st=0, dr=l;
while(st+1!=dr)
{
int m=(st+dr)/2;
if(lis[m]<v[i])
{
st=m;
}
else
{
dr=m;
}
}
lis[st+1]=v[i];
}
}
}
}
return {l, index};
}
int main()
{
int n;
in>>n;
for(int i=1; i<=n; i++)
{
in>>v[i];
}
out<<scmax(n).first;
}