Pagini recente » Cod sursa (job #2763841) | Cod sursa (job #2391767) | Cod sursa (job #1865167) | Cod sursa (job #2886228) | Cod sursa (job #2575284)
#include <fstream>
using namespace std;
int v[101], fin[101], rezultat[101], n, i, j, k = 0, z, y, verif = 0;
bool bin[101];
ifstream fi("scmax.in");
ofstream fou("scmax.out");
void citire()
{
fi>>n;
for (int i = 1; i <= n; i++)
fi >> v[i];
}
void unusidoi(int& k)
{
while (z > 0)
{
if(j % 2 == 0)
bin[z] = false;
else
bin[z] = true, k++;
j /= 2;
z--;
}
}
void tempvect(int& j)
{
int y;
for (y = 1, j = 1; y <= n; y++)
if (bin[y] == true and fin[j-1] < v[y])
fin[j] = v[y], j++;
}
void finvect()
{
for(int t = 1; t < verif; t++)
rezultat[t]=fin[t];
}
void afisare()
{
for (int i = 1; i < verif; i++)
fou << rezultat[i] << " ";
}
int main()
{
citire();
fin[0] = -1;
for (i = 1; k != n; i++)
{
j = i;
z = n;
k = 0;
unusidoi(k);
tempvect(j);
if (j >= verif)
{
verif = j;
finvect();
}
}
afisare();
return 0;
}