Pagini recente » Cod sursa (job #2471354) | Cod sursa (job #3184517) | Cod sursa (job #2874122) | Cod sursa (job #3268055) | Cod sursa (job #2065193)
#include<fstream>
#include<cmath>
#include<algorithm>
using namespace std;
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
const int MAX=1e4+1;
int n, m, v[MAX], r, maxm;
int main(){
cin>>n;
for(int i=1; i<=n; i++)
cin>>v[i];
sort(v+1, v+n+1);
int pas=1<<10;
/*pas=1<<16;
for(int i=1; i<=n; i++){
while(pas!=0){
if(r+par<=n && v[r+par]<=x){
r+=par;
}
r++;
}
min1=r;
r=0;
while(pas!=0){
if(r+par<=n && v[r+par]<=x && v[r+par]!=min1){
r+=par;
}
r++;
}
min2=r;
r=0;
while(pas!=0){
if(r+par<=n && v[r+par]<x){
r+=par;
}
}
maxm=r;
if(min1+min2>=maxm){ r-j
*/
for(int i=1; i<n; i++)
for(int j=i+1; j<=n; j++){
r=0;
while(pas!=0){
if(r+pas<=n && v[r+pas]<=v[i]+v[j]){
r+=pas;
}
pas/=2;
}
if(r>maxm)
maxm=r;
}
cout<<maxm-r;
return 0;
}