Pagini recente » Cod sursa (job #79643) | Cod sursa (job #1341674) | Cod sursa (job #2114134) | Cod sursa (job #2362808) | Cod sursa (job #1844267)
#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 caut1(int s,int d,int x)
{
int mij;
if(s<d)
{
mij=(s+d)/2;
if(x<v[mij])
{
return mij;
}
else
caut1(mij+1,d,x);
}
}
int caut2(int s,int d,int x)
{
int mij;
if(s<d)
{
mij=(s+d)/2;
if(v[mij]<x)
{
return mij;
}
else
caut2(s,mij-1,x);
}
}
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);
for(i=2;i<n;i++)
{
p=caut1(i,n,v[i]);
k=caut2(1,i,v[i]);
if(v[i]+v[k]>=v[p])
{
nr++;
}
}
g<<nr;
}