Pagini recente » Cod sursa (job #1658761) | Cod sursa (job #516131) | Cod sursa (job #966887) | Cod sursa (job #2390171) | Cod sursa (job #2282055)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sclm.in");
ofstream g("sclm.out");
int n,a[1001],x[1001],maxt,p;
int main()
{
f>>n;
for (int i=1; i<=n; i++)
f>>a[i];
for (int i=1; i<=n; i++)
x[i]=1;
for (int i=n-1; i>=1; i--)
{
int maxi=0;
for (int j=i+1; j<=n; j++)
{
if (a[j]>a[i])
{
if (x[j]>maxi)
{
maxi=x[j];
}
}
}
x[i]=maxi+1;
if (x[i]>maxt)
{
maxt=x[i];
p=i;
}
}
g<<maxt<<'\n';
g<<p<<" ";
/*for (int i=1; i<=n; i++)
cout<<x[i]<<" ";*/
for (int i=p+1; i<=n; i++)
{
if (x[i]==x[p]-1)
{
if (a[i]!=a[p])
{
g<<i<<" ";
p=i;
}
}
}
return 0;
}