Cod sursa(job #1844230)
Utilizator | Data | 9 ianuarie 2017 20:29:38 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 1.73 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int i,j,n,k,t,p,nr=0;
int* v;
void quick(int s,int d)
{
int i,j,x,t;
i=s;
j=d;
x=v[(i+j)/2];
do
{
while(v[i]<x)
i++;
while(v[j]>x)
j--;
if(i<=j)
{
t=v[i];
v[i]=v[j];
v[j]=t;
i++;
j--;
}
}while(i<=j);
if(i<d)
quick(i,d);
if(j>s)
quick(s,j);
}
int main()
{
int st,dr,x;
f>>n;
v=new int[n+4];
for(i=1;i<=n;i++)
f>>v[i];
quick(1,n);
k=1;
int mij=0;
int nr=0,ok=1;
for(i=2;i<=n;i++)
{
ok=0;
x=v[i];
st=1;
dr=n;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>x)
{
if(ok==1)
{
nr++;
st=dr+1;
}
else
if(ok==0)
{
ok=1;
dr=mij-1;
}
}
else
if(v[mij]<x)
{
if(ok==1)
{
nr++;
st=dr+1;
}
else
if(ok==0)
{
ok=1;
st=mij+1;
}
}
else
{
st=mij+1;
}
}
}
g<<nr;
}