-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathhasan.cpp
executable file
·64 lines (58 loc) · 1.3 KB
/
hasan.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <iostream>
#include<cmath>
#include<climits>
#include<iomanip>
using namespace std;
double distance(int x,int xx,int y,int yy){
double ans = (x-xx)*(x-xx) + (y-yy)*(y-yy);
if(ans < 0){
ans = -1*ans;
}
ans = sqrt(ans);
return ans;
}
double hasan(int a,int n,int*xi,int*yi,int*fi,int k,double**dp){
if(a==0){
return fi[0] + hasan(a+1,n,xi,yi,fi,k,dp);
}
if(a==n-1){
return fi[a] - distance(xi[k],xi[a],yi[k],yi[a]);
}
if(dp[a][k] > INT_MIN){
//cout<<" fbu";
return dp[a][k];
}
double one = fi[a] - distance(xi[k],xi[a],yi[k],yi[a]) + hasan(a+1,n,xi,yi,fi,k+1,dp);
double two = hasan(a+1,n,xi,yi,fi,k,dp);
double final = max(one,two);
dp[a][k] = final;
return final;
}
int main(){
int n;
cin>>n;
int *xi = new int[n];
int *yi = new int[n];
int *fi = new int[n];
for(int i=0;i<n;i++){
cin>>xi[i]>>yi[i]>>fi[i];
}
double**dp = new double *[n+1];
for(int i=0;i<=n;i++){
dp[i] = new double[n+1];
for(int j=0;j<=n;j++){
dp[i][j] =INT_MIN;
}
}
double d = hasan(0,n,xi,yi,fi,0,dp);
std::cout << std::fixed;
std::cout << std::setprecision(6);
std::cout << d;
cout<<endl;
for(int i=0;i<=n;i++){
// dp[i] = new double[n+1];
for(int j=0;j<=n;j++){
cout<<dp[i][j]<<" ";
}cout<<endl;
}
}