模拟退火算法解一道leetcode题

最新推荐文章于 2022-10-08 08:54:13 发布

应凌云

最新推荐文章于 2022-10-08 08:54:13 发布

阅读量427

点赞数

文章标签： leetcode c++

本文链接：https://blog.csdn.net/qq_43470425/article/details/115444023

版权

1815. 得到新鲜甜甜圈的最多组数

class Solution {
public:
    int n, m;
    vector<int> w;
    int ans;

    int calc() {
        int res = 1;
        for (int i = 0, s = 0; i < n; i ++ ) {
            s = (s + w[i]) % m;
            if (!s && i < n - 1) res ++ ;
        }
        ans = max(ans, res);
        return res;
    }

    void simulate_anneal() {
        random_shuffle(w.begin(), w.end());

        for (double t = 1e6; t > 1e-5; t *= 0.97) {
            int a = rand() % n, b = rand() % n;
            int x = calc();
            swap(w[a], w[b]);
            int y = calc();
            int delta = y - x;
            //if (!(exp(-delta / t) > (double)rand() / RAND_MAX))	//min
            if (!(exp(delta / t) > (double)rand() / RAND_MAX))	//max
                swap(w[a], w[b]);
        }
    }

    int maxHappyGroups(int batchSize, vector<int>& groups) {
        w = groups;
        n = w.size();
        m = batchSize;
        ans = 0;
        for (int i = 0; i < 80; i ++ ) simulate_anneal();
        return ans;
    }
};