Pagini recente » Cod sursa (job #1176218) | Cod sursa (job #1221097) | Cod sursa (job #869634) | Cod sursa (job #2069653) | Cod sursa (job #721197)
Cod sursa(job #721197)
#include<fstream>
#define abs(a) (a)>0?(a):-(a)
#define max(a,b) (a)>(b)?(a):(b)
using namespace std;
pair<int,int> a[220];
int n;
int div(int st,int dr,int tata)
{int ma=0,i;
for(i=st;i<=dr;i++)
ma=max(div(st,i-1,i)+div(i+1,dr,i)+a[i].second+a[tata].second+abs(a[tata].first-a[i].first),ma);
return ma;
}
int main()
{int i;
ifstream f("wanted.in");
ofstream g("wanted.out");
f>>n;
for(i=1;i<=n;i++)
f>>a[i].first>>a[i].second;
sort(a+1,a+n+1);
g<<div(1,n,0);
f.close();
g.close();
}