Cod sursa(job #1145435)
| Utilizator | Data | 18 martie 2014 10:40:52 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream in("copaci4.in");
ofstream out("copaci4.out");
int n,a[200005],nr;
int main()
{
in>>n;
for(int i=1;i<=n;i++) in>>a[i];
for(int i=2;i<n;i++)
{
int st=i-1,dr=i+1;
while(st && a[st] < a[i])st--;
if(st && a[st] > a[i])
{
while(dr <= n && a[dr] < a[i]) dr++;
if(st && dr <= n && a[dr] > a[i] && a[st] >a [i]) nr++;
}
}
out<<nr<<'\n';
return 0;
}
