Pagini recente » Cod sursa (job #1889789) | Cod sursa (job #44353) | Cod sursa (job #48474) | Cod sursa (job #1084176) | Cod sursa (job #1668395)
#include <fstream>
using namespace std;
ifstream f("subsir2.in");
ofstream g("subsir2.out");
int n,i,j,mi,k,mx,nr,s[5010],l[5010],v[5010];
int main()
{
f >> n;
for(i = 1; i <= n; ++i)
f >> v[i];
for(i = n - 1; i >= 1; --i)
{
mi = 40000000;
l[i] = 40000000;
for(j = i + 1; j <= n; ++j)
{
if(v[j] < mi && v[i] <= v[j])
{
mi = v[j];
nr = l[j] + 1;
if(l[i] == nr &&v[j] < v[s[i]])
s[i] = j;
if(nr < l[i])
{
l[i] = nr;
s[i] = j;
}
}
}
if(l[i] == 40000000)
{
s[i] = i;
l[i] = 1;
}
}
mx = 0;
for(i = 1; i <= n; ++i)
if(l[i] > mx)
{
mx = l[i];
k = i;
}
++mx;
g << mx << '\n';
while(mx > 0)
{
--mx;
g << k << " ";
k = s[k];
}
g << '\n';
return 0;
}