Cod sursa(job #955268)
Utilizator | Data | 31 mai 2013 10:51:49 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
#include<bitset>
#define p 20000001
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int main()
{
bool n, i, k, a[p];
fin>>n;
for(i=1; i<=n; i++)
{
fin>>a[i];
}
for(i=1; i<=n; i++)
{
if(a[i]<a[i+1])
k++;
else if(a[i]>a[i+1])
i++;
}
fout<<k;
fin.close();
fout.close();
return 0;
}