ACM学习
文章平均质量分 91
阿华咸
这个作者很懒,什么都没留下…
展开
-
A*与IDA*算法学习笔记
A*简介A*搜索算法(英文:A*search algorithm,A*读作 A-star),简称 A*算法,是一种在图形平面上,对于有多个节点的路径求出最低通过成本的算法。它属于图遍历(英文:Graph traversal)和最佳优先搜索算法(英文:Best-first search),亦是 BFS 的改进。定义起点 sss ,终点 ttt ,从起点(初始状态)开始的距离函数 g(x)g(x)g(x),到终点 (最终状态)的距离函数 h(x)h(x)h(x) , h′(x)h'(x)h′(x)原创 2021-01-25 22:21:12 · 561 阅读 · 0 评论 -
Codeforces1453B题解
Code#include<bits/stdc++.h>#define ll long longusing namespace std;ll abss(ll a){ if (a<0) return -a; return a;}ll maxx(ll a,ll b){ if (a>b) return a; return b;}int main(){ int n; ll a[200005]; ll x,y,ans; i.转载 2020-12-05 10:08:09 · 287 阅读 · 0 评论 -
Codeforces 1422C题解
题目C. Bargaintime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSometimes it is not easy to come to an agreement in a bargain. Right now Sasha and Vova can’t come to an agreement: Sasha names a price a原创 2020-10-05 21:53:59 · 620 阅读 · 0 评论 -
Codeforces1426D题解
问题描述D. Non-zero Segmentstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKolya got an integer array a1,a2,…,an. The array can contain both positive and negative integers, but Kolya doesn’t like 0,原创 2020-09-30 17:05:13 · 340 阅读 · 0 评论 -
Codeforces1401D题解
题目描述D. Maximum Distributed Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a tree that consists of n nodes. You should label each of its n−1 edges with an integer in such way tha原创 2020-08-23 11:30:26 · 441 阅读 · 0 评论 -
Codeforces 1398C
问题描述C. Good Subarraystime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array a1,a2,…,an consisting of integers from 0 to 9. A subarray al,al+1,al+2,…,ar−1,ar is good if the sum of e原创 2020-08-15 01:30:09 · 326 阅读 · 0 评论 -
Codeforces1399D题解
题面D. Binary String To Subsequencestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a binary string s consisting of n zeros and ones.Your task is to divide the given string into the m原创 2020-08-06 11:10:19 · 336 阅读 · 0 评论 -
Codeforces 1388D题解
问题描述D. Captain Flint and Treasuretime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputCaptain Fint is involved in another treasure hunt, but have found only one strange problem. The problem may be conn转载 2020-07-31 11:34:48 · 420 阅读 · 0 评论 -
Codeforces 1379A题解
A. Acacius and Stringtime limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputAcacius is studying strings theory. Today he came with the following problem.You are given a string s of length n consisting of翻译 2020-07-21 17:24:22 · 1008 阅读 · 2 评论 -
ALDS1_4_D:搜索的应用---计算最优解(二分法的应用)
题面You are given n packages of wi kg from a belt conveyor in order (i=0,1,…n−1). You should load all packages onto k trucks which have the common maximum load P. Each truck can load consecutive packages (more than or equals to zero) from the belt conveyor原创 2020-07-20 18:00:50 · 485 阅读 · 0 评论 -
Codeforces 1385D题解
题目描述D. a-Good Stringtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a string s[1…n] consisting of lowercase Latin letters. It is guaranteed that n=2k for some integer k≥0.The string翻译 2020-07-18 13:01:24 · 490 阅读 · 0 评论 -
希尔排序(shell sort)学习笔记
什么是希尔排序一种进阶版的插入排序,不稳定(因为多次插入了),适合大范围顺序不是太乱的数据排序(这点跟插入有点像)首先先引入插入排序:插入排序这是一种稳定的排序算法(因为每次排序时只是把其他元素进行平移,相等大小的元素们的相对位置并没有改变)。实现方法就像整理扑克牌一样,将第i张牌与前i-1张牌面额逐个比较,如果找到最前面的那个大于第i张牌面额的牌的位置p,则先将从p开始到i-1的所有牌的位置后移一格,然后将这第i张牌插入到p位置,从第一张牌开始整理,到第n张牌结束,如此重复操作,最终实现排序。原创 2020-07-15 19:03:50 · 205 阅读 · 0 评论 -
Codeforces1372B题解
题目:B. Omkar and Last Class of Mathtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn Omkar’s last class of math, he learned about the least common multiple, or LCM. LCM(a,b) is the smallest positiv翻译 2020-07-13 01:54:27 · 299 阅读 · 0 评论 -
Codeforces 1375C题解
Codeforces 1375C题解题目描述You are given an array a of length n, which initially is a permutation of numbers from 1 to n. In one operation, you can choose an index i (1≤i<n) such that ai<ai+1, and remove either ai or ai+1 from the array (after the remov翻译 2020-07-09 18:58:36 · 806 阅读 · 0 评论