Pagini recente » Cod sursa (job #2186091) | Cod sursa (job #2238830) | Cod sursa (job #65741) | Cod sursa (job #2449931) | Cod sursa (job #731131)
Cod sursa(job #731131)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int main()
{
int lg = 1, lgmax = 1, l = 0, l2 = 0, dr, drmax, a[100000];
int n;
fin >> n;
for(int i = 1; i <= n; i++)
fin >> a[i];
a[n+1] = -32000;
for(int i = 1; i <= n; i++)
if(a[i + 1] > a[i])
{
lg++;
dr = i + 1;
}
else
if(a[i] == a[i + 1])
{
l2++;
while(a[i] == a[i + 1])
{
i++;
l++;
}
i--;
}
else
{
if(lg > lgmax)
{
lgmax = lg;
drmax = dr;
}
lg = 1;
}
fout << lgmax << '\n';
for(int i = drmax - lgmax - l + 1 ; i <= drmax; i++)
if(a[i] != a[i + 1])
fout << a[i] << " ";
fin.close();
fout.close();
return 0;
}