buzzaz的博客

整个Springboot项目都容器化，部署到云服务器。

Springboot开发后端，前端JS及其框架。

Vue3 + Vite部署单页。

读研的研究课题是边缘计算，先学习云计算基础。云计算是分布式计算的一种特殊形式，它引入效用模型来远程供给可扩展和可测量的资源。

模拟退火+粒子群算法

You have N integers, A1, A2, … , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask for the sum of numbers in a given interval.InputThe first line c

题目：题目题意：求出∑i=2N∑j=1i−1(ai−aj)2\sum_{i=2}^N\sum_{j=1}^{i-1}(a_i-a_j)^2∑i=2N​∑j=1i−1​(ai​−aj​)2思路：暴力求解是O(n2)O(n^2)O(n2)的时间复杂度，必然TLE，需要对式子进行化简。∑i=2N∑j=1i−1(ai−aj)2\sum_{i=2}^N\sum_{j=1}^{i-1}(a_i-a_j)^2∑i=2N​∑j=1i−1​(ai​−aj​)2=(N−1)∑i=1Nai2−∑i=2N∑j=1i−12a

题目：AtCoder - abc194_e 题意：我们要找到长度为 n 数组 A 的所有的长度为 m 的切片 si 最小的 mex(si) 值。思路：可以发现，如果记录切片中每一个数字出现的次数，找到第一个出现次数为0的就是答案。但是我们不能每次切片改变都去遍历一次，这样会TLE，因此可以用一个数组M维护区间（i,i+m）数字出现的次数。切片的末尾指向了 Ai 的时候，那么对应的 Ma[i]M_{a[i]}Ma[i]​就会加1；而Ma[i−m]M_{a[i-m]}Ma[i−m]​ 就会减1。接下

AtCoder - arc114_a题目题意：找出一个数Y使得它与数组a内所有的数a[i]都不互质，即gcd(Y,a[i])!=1思路：大部分题目都是要求互质的数，本题反其道而行，而且求不互质的数并不容易。gcd(Y,a[i])!=1意味着什么？即a中每个数都与Y要有一个公因子，可以证明，公因子d必然为质数。另外，本题的a[i]<=50，因此可以暴力枚举2~50所有的质数，利用二进制枚举模拟所有质数选择的情况，必然能找到一个答案。code：#include <bits/stdc++

CodeForces - 1473B题目Let’s define a multiplication operation between a string a and a positive integer x: a⋅x is the string that is a result of writing x copies of a one after another. For example, “abc” ⋅ 2 = “abcabc”, “a” ⋅ 5 = “aaaaa”.A string a is di

AtCoder - abc193_c题目Problem StatementGiven is an integerN. How many integers between1andN(inclusive) are unrepresentable asab, whereaandbare integers not less than2?ConstraintsNis an integer.1≤N≤1010InputInput is given from Sta

POJ - 3264For the daily milking, Farmer John’s N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the cows. To keep things simple, he will take a contiguous range of co

CodeForces - 1486ACodeForces - 1486AYou have n stacks of blocks. The i-th stack contains hi blocks and it’s height is the number of blocks in it. In one move you can take a block from the i-th stack (if there is at least one block) and put it to the i+1-

Find Maximum （二进制）CodeForces - 353C [GO](https://codeforces.com/problemset/problem/353/C)Valera has array a, consisting of n integers a0, a1, …, an - 1, and function f(x), taking an integer from 0 to 2n - 1 as its single argument. Value f(x) is calculat