Pagini recente » Cod sursa (job #1639150) | Rating Imogen Shaw (6giannae411gL9) | Cod sursa (job #950830) | Cod sursa (job #2018917) | Cod sursa (job #1528178)
/*
NETERMINATA!!!
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("euro2.in");
ofstream g("euro2.out");
float a[10001];
float s1[10001], s2[10001];
short d1[10001], d2[10001];
short n, i, j, k1, k2, st, dr, poz, m;
int main()
{
f >> n;
for (i = 1; i <= n; i++)
f >> a[i];
for (i = 1; i <= n; i++)
{
if (a[i] > s1[k1])
s1[++k1] = a[i], d1[k1] = i;
else
{
st = 1, dr = poz = k1;
while (st <= dr)
{
m = (st+dr)/2;
if (a[i] > s1[m])
st = m+1;
else
dr = m-1, poz = m;
}
s1[poz] = a[i];
d1[poz] = i;
}
}
for (i = 1; i <= n/2; i++)
swap(a[i], a[n-i+1]);
for (i = 1; i <= n; i++)
{
if (a[i] > s1[k2])
s2[++k2] = a[i], d2[k2] = i;
else
{
st = 1, dr = poz = k2;
while (st <= dr)
{
m = (st+dr)/2;
if (a[i] > s1[m])
st = m+1;
else
dr = m-1, poz = m;
}
s2[poz] = a[i];
d2[poz] = i;
}
}
/*for (i = 1; i <= n; i++)
g << a[i] << '\n';*/
return 0;
}