Cod sursa(job #1232122)
| Utilizator | Data | 22 septembrie 2014 07:52:33 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#define SIZE 100000
using namespace std;
int V[SIZE];
int main()
{
ifstream ifs("scmax.in")
ofstream ofs("scmax.out")
int n; ifs >> n;
for (int i = 0; i < n; ++i)
ifs >> V[i];
int best_max = 1, best_left = 0;
int max = 1, left = 0;
for (int i = 1; i < n; ++i)
{
if (V[i] > V[i-1])
{
++max
if (max > best_max)
{
best_max = max;
}
}
else
{
max = 1;
left = i;
}
}
ofs << best_max << "\n";
for (int i = best_left; i < best_left + best_max; ++i)
ofs << V[i] << " ";
return 0;
}