Pagini recente » Cod sursa (job #1123647) | Cod sursa (job #3140591) | Cod sursa (job #876409) | Cod sursa (job #1194611) | Cod sursa (job #2964248)
#include <fstream>
using namespace std;
const int N = 100000;
int v[N + 1];
int dp[N + 1];
int main()
{
ifstream in("scmax.in");
ofstream out("scmax.out");
int n;
in >> n;
for (int i = 1; i <= n; i ++)
{
in >> v[i];
}
for (int i = 1; i <= n; i ++)
{
if (v[i] <= v[i - 1])
{
dp[i] = dp[i - 1];
}
else
{
dp[i] = dp[i - 1] + 1;
}
}
out << dp[n] << '\n';
for (int i = 1; i < n; i ++)
{
if (dp[i] < dp[i + 1])
{
out << v[i] << ' ';
}
}
out << v[n];
in.close();
out.close();
return 0;
}
/*
0 24 12 15 15 19
0 1 1 2 2 3
*/