Pagini recente » Cod sursa (job #1920674) | Cod sursa (job #1545378) | Cod sursa (job #483482) | Cod sursa (job #1062152) | Cod sursa (job #1400376)
#include <fstream>
using namespace std;
ifstream f("secv.in");
ofstream g("secv.out");
int a[5001], b[5001], c[5001], d[5001];
int k, m, n, i, j, st, dr, poz;
int main()
{
f >> n;
for (i = 1; i <= n; i++)
f >> a[i];
b[0] = 0, k = 0;
for (i = 1; i <= n; i++)
{
if (b[k] < a[i])
k++, b[k] = a[i], c[i] = k;
else
{
st = 1, dr = k, poz = k;
while (st <= dr)
{
m = (st+dr)/2;
if (b[m] < a[i])
st = m+1;
else
dr = m-1, poz = m;
}
b[poz] = a[i];
c[i] = poz;
d[poz] = i;
}
}
for (i = n, j = 0; i >= 1 && k > 0; i--)
if (c[i] == k)
j++, b[j] = a[i], k--, d[j] = i;
g << d[1]-d[j]+1;
return 0;
}