Pagini recente » Cod sursa (job #2586201) | Cod sursa (job #3259155) | Cod sursa (job #1320625) | Cod sursa (job #2627244) | Cod sursa (job #2175824)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, arr[100005];
void solve();
int main()
{
fin >> n;
for (int i = 0; i < n; i++)
{
fin >> arr[i];
}
solve();
return 0;
}
void solve()
{
int mxLen = -1, len, mxPos = -1, prev;
for (int i = 0; i < n; i++)
{
prev = arr[i];
len = 1;
for (int j = i; j < n; j++)
{
if (arr[j] > prev)
{
len++;
prev = arr[j];
if (len > mxLen && prev > mxPos)
{
mxLen = len;
mxPos = i;
}
}
}
}
fout << mxLen << "\n";
prev = arr[mxPos];
fout << prev << " ";
for (int i = mxPos+1; i < n; i++)
{
if (arr[i] > prev)
{
fout << arr[i] << " ";
prev = arr[i];
}
}
}