Project Euler_Problem 190_Maximising a Weighted Product_最优化问题，梯度方向

原题目：

题目大意：条件极值, k个实数加起来=k，问当怎么取值的时候,x_1*x_2^2....x_k^k乘起来最大

解题思路: 条件极值问题，求那个连乘的梯度方向，然后从低的往高的挪值，重复个几十万次，就ok了

代码：

void solve() {
    ll i, j,k,x,y,z,p,q,u,v;
    ll N = 15,NN=1000;
    double a, b, c,d;

    for (i = 2; i <= N; i++) {

        ll T = 200000;
        for (j = 1; j <= i; j++) {
            AA[j] = 1.0;
        }
        d = 1.0;
        while (T) {


            for (k = 1; k <= i; k++) {
                c = k;
                for (p = 1; p <= i; p++) {
                    if (p == k) {
                        if (p == 1)continue;
                        c = c * pow(AA[p], p - 1);
                    }
                    else {
                        c = c * pow(AA[p], p);
                    }
                }
                BB[k] = c;
            }

            a = T / 800000.0;

            double M = BB[1], m = BB[1];
            ll M1 = 1, m2 = 1;
            for (k = 2; k <= i; k++) {
                if (BB[k] > M) {
                    M = BB[k];
                    M1 = k;
                }
                if (BB[k] < m) {
                    m = BB[k];
                    m2 = k;
                }

            }
            a = min(AA[m2], a);
            AA[M1] = AA[M1] + a;
            AA[m2] = AA[m2] - a;
            double sum1 = 1;
            for (k = 1; k <= i; k++) {
                sum1 = sum1 * pow(AA[k], k);
            }  
            if (sum1 > d) {
                d = sum1;
            }
            T--;
        }
        printf("%lf\n", d);
        ans1 = ans1 + d;
    }
    
    printf("%lld\n",ans1);
}