Pagini recente » Cod sursa (job #1676385) | Cod sursa (job #2907516) | Cod sursa (job #209054) | Cod sursa (job #2420456) | Cod sursa (job #2711106)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("subsir2.in");
ofstream fout("subsir2.out");
const int nmax = 5000 + 50;
int n, v[nmax], dp[nmax], urm[nmax];
bool marked[nmax];
int main()
{
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> v[i];
}
for (int i = n; i >= 1; --i) {
int nr = INT_MAX;
marked[i] = true;
for (int j = i + 1; j <= n; ++j) {
if (v[j] >= v[i]) {
marked[j] = false;
}
if (v[j] >= v[i] && v[j] < nr) {
if (dp[j] >= dp[i]) {
dp[i] = dp[j];
nr = v[j];
urm[i] = j;
}
}
}
dp[i]++;
}
int mini = INT_MAX, poz;
for (int i = 1; i <= n; ++i) {
if (marked[i] && dp[i] < mini) {
mini = dp[i];
poz = i;
}
}
fout << mini << '\n';
fout << poz << ' ';
while(urm[poz]) {
fout << urm[poz] << ' ';
poz = urm[poz];
}
return 0;
}