Pagini recente » Cod sursa (job #2783389) | Cod sursa (job #2989593) | Cod sursa (job #2878713) | Cod sursa (job #2857112) | Cod sursa (job #2107461)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,k,i,v[100001],g[100001],max=-99999999,f,j,x;
ifstream q("scmax.in");
ofstream w("scmax.out");
q>>n;
g[n]=1;
for(i=1;i<=n;i++) q>>v[i];
for(i=n-1;i>=1;i--)
{
g[i]=1;x=0;
for(j=i+1;j<=n;j++)
{
if(v[i]<v[j]&&v[j]!=x) {g[i]++;x=v[j];}
if(g[i]>max) {max=g[i];f=i;}
}
}
w<<max<<endl;
k=max;
for(i=1;i<=n;i++)
{
if(i==f) {w<<v[i]<<" ";k--;}
if(g[i]==k) {w<<v[i]<<" ";k--;}
}
return 0;
}