Game with points(数学,难度中)

Game with points

Time Limit:500MS   

Memory Limit:65536KB    64bit IO Format:%I64d & %I64u

Description

Recently Petya has discovered new game with points. Rules of the game are quite simple. First, there is onlyone point A 0 with coordinates (0, 0). Then Petya have to draw N another points. Points must be drawnconsequently and each new point must be connected with exactly one of the previous points by a segment.Let's decribe the game process more formally. At the i-th step Petya chooses the position of the point A i (notnecessarily with integer coordinates). Than he chooses one of the previously drawn points in order to connect it with thepoint A i. Lets call this point B. The following conditions must be held:
  • Point Ai must not coincide with any of the previous points.
  • Point Ai must not lie on the previously drawn segments.
  • Segment AiB must not have common points with previously drawn segments, except possibly the point B.
  • Segment AiB must not cover any of the previous points, except the point B.
  • Length of the segment AiB must not exceed 1. After drawing each point Petya computes two values.
  • The largest number of segments which share a common point.
  • The largest euclid distance between some pair of points. After each step Petya gains the score which is equal to the product of these values.Find out which is the maximal score Petya can gain after the whole game.

Input

Input contains single integer number N (0 ≤ N ≤ 1000).

Output

Output the maximal score that Petya can gain. Your answer must be accurate up to 10 -3.

Sample Input

sample input
sample output
2
5.000

 

sample input
sample output
4
20.000


设第i步具有公共点的最大线段数为m, 点间距离最大值为l,则该步所添加的线段要么使m加1,要么使l加1,这样才能确保最终答案最大。当满足

(m + 1) * l >= m * (l + 1)时,使m加1更优,否则使l加1更优。注意特殊情况i = 2,因为在这一步能使m和l同时加1.

此题输出小数有误导成分,实际上答案是整数,再化做小数输出即可。

AC CODE:

 1 //Memory: 935 KB         Time: 31 MS
 2 //Language: GNU CPP (MinGW, GCC 4)         Result: Accepted
 3 
 4 #include <iostream>
 5 #include <string>
 6 #include <cstdio>
 7 #include <cmath>
 8 #include <cstring>
 9 #include <algorithm>
10 #include <map>
11 #define LL long long
12 #define MAXI 2147483647
13 #define MAXL 9223372036854775807
14 #define eps (1e-8)
15 #define dg(i) cout << "*" << i << endl;
16 using namespace std;
17 
18 int main()
19 {
20     int l, m, n;
21     double ans;
22     while(scanf("%d", &n) != EOF)
23     {
24         if(!n) ans = 0.0;
25         else if(n == 1) ans = 1.0;
26         else if(n == 2) ans = 5.0;
27         else
28         {
29             ans = 5.0;
30             l = 2;
31             m = 2;
32             while(n-- > 2)
33             {
34                 if(l <= m)
35                 {
36                     l++;
37                     ans += (1.0 * l * m);
38                 }
39                 else
40                 {
41                     m++;
42                     ans += (1.0 * l * m);
43                 }
44             }
45         }
46         printf("%.3lf\n", ans);
47     }
48     return 0;
49 }

 

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值