Pagini recente » Cod sursa (job #2101525) | Cod sursa (job #1553414) | Cod sursa (job #2825301) | Cod sursa (job #3234328) | Cod sursa (job #3310654)
#include <bits/stdc++.h>
using namespace std;
const int NMAX=50000;
struct Oras {
int D, L;
};Oras v[NMAX+1];
bool cmp(const Oras &a, const Oras &b) {
return a.D < b.D;
}
int main() {
ifstream fin("orase.in");
ofstream fout("orase.out");
int n;
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i].D>>v[i].L;
sort(v+1,v+n+1,cmp);
long long mindif=v[1].D-v[1].L;
int jmin=1;
long long r=0;
int ri=1,rj=1;
for(int i=2;i<=n;i++){
long long cand=(long long)v[i].D+v[i].L-mindif;
if(cand>r){
r=cand;
ri=i;
rj=jmin;
}
if((long long)v[i].D-v[i].L<mindif){
mindif=v[i].D-v[i].L;
jmin=i;
}
}
fout<<rj<<" "<<ri<<" "<<r;
return 0;
}