Pagini recente » Cod sursa (job #1439221) | Cod sursa (job #1624634) | Cod sursa (job #1343741) | Cod sursa (job #2748806) | Cod sursa (job #2940289)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
const int NMAX = 805;
int n, arr[NMAX], cnt;
inline void solve()
{
sort(arr + 1, arr + n + 1);
for(int i = 1; i < n; ++ i)
{
for(int j = i + 1; j <= n; ++ j)
{
int st = j + 1, dr = n, l1 = arr[i], l2 = arr[j], poz = 0;
while(st <= dr)
{
int mid = (st + dr) / 2;
if(arr[mid] > l1 + l2)
{
//cout << mid;
dr = mid - 1;
}
else
{
poz = mid;
st = mid + 1;
}
}
if(poz)
{
cnt += poz - j;
}
}
}
fout << cnt;
}
int main()
{
fin >> n;
for(int i = 1; i <= n; ++ i)
fin >> arr[i];
solve();
}