DESCRIPTION
给一个正整数nn,求下列表达式的最大值:
(sin(x)+sin(y)+sin(z))[x+y+z=n][x≥1][y≥1][z≥1](sin(x)+sin(y)+sin(z))[x+y+z=n][x≥1][y≥1][z≥1]
为了降低难度,这里的x,y,zx,y,z皆为整数
INPUT
输入只有一行,包含一个正整数
n(3≤n≤3∗106)n(3≤n≤3∗106)
OUTPUT
输出一行表示答案,请恰好保留
99位小数.(你的答案必须和标准答案完全一样才算通过)
SAMPLE INPUT
3
SAMPLE OUTPUT
2.524412954
思路:先转化sin(x)+sin(y)+sin(z)=2*sin((x+y)/2)*cos((x-y)/2)+sin(n-(x+y));
x+y的取值范围为[2,n-1],假设固定x+y,则相当于求A*cos((x-y)/2)+B的最大取值;
则本题转化为对于固定x+y,怎么求cos(...)函数最大取值;
我们先举几个例子观察:(ps:x,y,z均>=1)
1)x+y=2,则x-y={0};
2)x+y=4,则x-y={-2,0,2};
3)x+y=6,则x-y={-4,-2,0,2,4};
观察x-y取值特点迭代更新即可;(ps:cos()函数对称)
代码:
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
double ans = -1E9;
double m1 = -1E9, m2 = -1E9;
for (double i = 2; i < n; i += 2)
{
m1 = max(m1, cos( (i - 2) / 2 ));
ans = max(ans, 2. * sin(i/2) * m1 + sin(n - i));
}
for (double i = 3; i < n; i += 2)
{
m2 = max(m2, cos( (i - 2) / 2 ));
ans = max(ans, 2. * sin((double)i/2) * m2 + sin(n - i));
}
printf("%.9f\n",ans);
return 0;
}