Pagini recente » Cod sursa (job #1973459) | Cod sursa (job #2582525) | Cod sursa (job #798350) | Cod sursa (job #948310) | Cod sursa (job #203163)
Cod sursa(job #203163)
#include <stdio.h>
#define FIN "nrtri.in"
#define FOUT "nrtri.out"
#define NMAX 1000
int n,i,j,x;
int v[NMAX];
int cautare(int p, int u)
{
int m;
m=(p+u)/2;
while (p<=u){
if ((v[m]<=v[i]+v[j] && v[m+1]>v[i]+v[j]) || (v[m]<=v[i]+v[j] && m==n-1))
return m;
else if (v[m]<=v[i]+v[j] && v[m+1]<=v[i]+v[j]) {
p=m+1;
m=(p+u)/2;
}
else {
u=m-1;
m=(p+u)/2;
}
}
return 0;
}
int main()
{
freopen(FIN,"rt",stdin);
freopen(FOUT,"wt",stdout);
scanf("%d", &n);
for (i=0;i<n;i++)
scanf("%d", &v[i]);
for (i=0;i<n-2;++i)
for (j=0;j<n-1;++j)
{
x=cautare(1,n);
}
printf("%d",x);
return 0;
}