Cod sursa(job #1982856)
Utilizator | Data | 20 mai 2017 13:54:48 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
int d[100000],i,k,n,max=1,d2[100000];
f>>n;
for(i=1;i<=n;i++)
f>>d[i];
i=1;
while(i<=n)
{if(d[i]<d[i+1]) {max++;
d2[i]=max;
}
i++;
}
g<<max;
f.close();
g.close();
return 0;
}