Cod sursa(job #900753)
| Utilizator | Data | 28 februarie 2013 21:38:40 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
int numar(int i)
{
nr=0;
int j;
for(j=i+1;j<n;j++)
if(v[j]>v[i])
nr++;
return nr;
}
int main()
{
int n,a[100],i,p,max=0;
ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n;
for(i=0;i<n;i++)
f>>v[i];
for(i=0;i<n-1;i++)
{
x=numar(i);
if(x>max)
max=x;
}
g<<max;
f.close();
g.close();
return 0;
}
