Pagini recente » Cod sursa (job #3201873) | Cod sursa (job #247096) | Cod sursa (job #72783) | Cod sursa (job #2802726) | Cod sursa (job #2043294)
#include <iostream>
#include <fstream>
#include<stack>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, v[100005], dp[100005], mx=-1, i, j, a, p;
stack<int> s;
int main()
{
f>>n;
dp[1]=1;
for(i=1; i<=n; i++)
{
f>>v[i];
}
for(i=2; i<=n; i++)
{
for(j=i-1; j>=1; j--)
{
if(v[i]>v[j]&&dp[j]>dp[i])
{
dp[i]=dp[j];
}
}
dp[i]++;
if(dp[i]>mx)
{
mx=dp[i];
}
///if(dp[i]==0)
///dp[i]=1;
}
g<<mx<<'\n';
p=mx;
while(n>0)
{
if(dp[n]==p)
{
s.push(v[n]);
p--;
}
n--;
}
while(!s.empty())
{
g<<s.top()<<' ';
s.pop();
}
return 0;
}