Cod sursa(job #1013143)
| Utilizator | Data | 20 octombrie 2013 13:43:42 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
long n,i,a[100000],j;
f>>n;
for(i=0;i<n;i++){
f>>a[i];
}
int nr=0;
int maxi=0;
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
if(a[j]>a[i]){
nr++;
}
}
if(nr>maxi)
maxi=nr;
nr=0;
}
g<<maxi;
return 0;
}
