Cod sursa(job #1120052)
Utilizator | Data | 24 februarie 2014 21:20:39 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int a[100003],maxi[100003],n;
ifstream f("scmax.in");
ofstream g("scmax.out");
int main()
{
f>>n;
int t=0, maximum=0;
for(int i=1; i<=n;i++)
f>>a[i];
for (int i=1; i<=n;i++)
{
t=a[i];
for(int q=i; q>0;q--)
{
if(a[q]<t) maxi[i]++;
}
if(maxi[i]>maximum) maximum=maxi[i];
}
g<<maximum;
return 0;
}