Pagini recente » Cod sursa (job #2947875) | Cod sursa (job #2543757) | Cod sursa (job #2717235) | Cod sursa (job #2247627) | Cod sursa (job #1787226)
#include <fstream>
using namespace std;
ifstream f ("scmax.in");
ofstream g ("scmax.out");
int n , V[100001] , sol[100001] , ns , a[100001];
void citire ()
{
f >> n;
for (int i = 1 ; i <= n ; ++i)
f >> V[i];
}
void afis(int k)
{
for (int i = 1 ; i <= k ; ++i)
{
sol[i] = a[i];
ns = k;
}
}
bool verif(int k)
{
if (V[a[k]] <= V[a[k - 1]])
return 0;
return 1;
}
void backt(int k)
{
if (k - 1 > ns) afis(k - 1);
for(int i = a[k] - 1 + 1 ; i <= n ; ++i)
{
a[k] = i;
if (verif(k))
backt(k + 1);
}
}
int main()
{
citire();
backt(1);
g << ns << '\n';
for (int i = 1 ; i <= ns; ++i)
g << V[sol[i]] << ' ';
g.close();
return 0;
}