Pagini recente » Cod sursa (job #2377686) | Cod sursa (job #1190817) | Cod sursa (job #624641) | Cod sursa (job #582586) | Cod sursa (job #1117571)
#include<fstream>
#define NMAX 5010
using namespace std;
ifstream f("subsir2.in");
ofstream g("subsir2.out");
int n, a[NMAX], lg[NMAX], prec[NMAX];
void Citeste()
{
int i;
f>>n;
for (i=1; i<=n; ++i) f>>a[i];
}
bool bun(int p, int u)
{
int i;
for (i=p+1; i<u; ++i)
if (a[p]<a[i] && a[u]>a[i]) return 0;
return 1;
}
void Solve()
{
int i, j, mn, imn;
for (i=n; i>0; --i)
{
mn=n+1; imn=0;
for (j=i+1; j<=n; ++j)
if (a[j]>=a[i] && bun(i, j))
{
if (mn>lg[j])
{
mn=lg[j];
imn=j;
}
else
if (mn==lg[j] && a[imn]>a[j]) imn=j;
}
if (mn==n+1)
{
lg[i]=1;
prec[i]=-1;
}
else
{
lg[i]=mn+1;
prec[i]=imn;
}
}
}
void Scrie()
{
int i, j, x, mn=lg[1], imn=1, ok;
for (i=2; i<=n; ++i)
{
ok=1;
for (j=1; j<i; ++j)
if (a[i]>a[j])
{
ok=0;
break;
}
if (ok)
{
if (mn>lg[i])
{
mn=lg[i];
imn=i;
}
else
if (mn==lg[i] && a[imn]>a[i]) imn=i;
}
}
g<<mn<<"\n";
x=imn;
while (x!=-1)
{
g<<x<<" ";
x=prec[x];
}
g<<"\n";
}
int main()
{
Citeste();
Solve();
Scrie();
f.close();
g.close();
return 0;
}