Cod sursa(job #654563)
Utilizator | Bodnariuc Dan Alexandru dutzul | Data | 30 decembrie 2011 17:33:52 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
struct two {
int x,y;
} v[1030];
int a[300],n,i,poz,l;
int cmp ( two a, two b )
{
if (a.x==b.x) return a.y<b.y;
return a.x < b.x;
}
int main()
{
f>>n;
for(i=1; i<=n; i++) {
f>>v[i].x;
v[i].y=i;
}
sort(v+1,v+n+1,cmp);
for(i=1; i<=n; i++)
if (v[i].y>poz) {
poz=v[i].y;
l++;
}
g<<l<<'\n';
return 0;
}