Codeforces Round #118 (Div. 1) A Mushroom scientists (multivariate function extremum problem + Lagrange multiplier method)

Topic Links: Codeforces Round #118 (Div. 1) A Mushroom scientists

Test instructions: Refinement is to seek f (x, Y, z) =x^a*y^b*z^b, the ternary function in the (0<=x,y,z,x+y+z<=s) region of the maximum value.

Ideas:

Stricter also proves that the value taken at the boundary is smaller than the extremum.

Note:%.10LF look at the output of the topic

AC Code:

#include <stdio.h>int main () {    int s;    int a,b,c;    Double x,y,z,p;    while (scanf ("%d", &s)!=eof) {        scanf ("%d%d", &a,&b,&c);        p=1.0* (a+b+c)/s;if (a+b+c==0) {x=0,y=0,z=0;printf ("%.10lf%.10lf%.10lf\n", X, Y, z); continue;}        x=a/p;        y=b/p;        z=c/p;        printf ("%.10lf%.10lf%.10lf\n", X, Y, z);    } return 0;}

Codeforces Round #118 (Div. 1) A Mushroom scientists (multivariate function extremum problem + Lagrange multiplier method)