Pagini recente » Cod sursa (job #2326608) | Istoria paginii runda/tema_1_lot/clasament | Cod sursa (job #2190861) | Cod sursa (job #1319685) | Cod sursa (job #2420457)
#include<fstream>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n, a[801], st, dr, j, sol, m;
int main()
{
f>>n;
for(int i=1;i<=n;++i)
f>>a[i];
int t=0;
for(int i=1;i<n;++i)
for(int j=i+1;j<=n;++j)
if(a[i]>a[j])
swap(a[i],a[j]);
for(int i=1;i<n;++i)
for(int j=i+1;j<=n;++j)
{
st=j+1; dr=n;
sol=-1;
while(st<=dr)
{
m=(st+dr)/2;
if(a[m]<=a[i]+a[j])
st=m+1, sol=m;
else
dr=m-1;
// cout<<a[i]<<' '<<a[j]<<' '<<a[m]<<'\n';
}
if(sol!=-1) t+=(sol-j);
}
g<<t;
return 0;
}