Zeolim的博客

A: 将数分为k组使得每组不包含数值差为1的数 解：正整数可直接分为两组 奇数 偶数 符合题意， 所以给定数列有相邻就是2否则就是1 B1 / B2: 给定一每个点出度为1的图问每个点走到自己需要多少步 明显走到自己是个环， 并且环上答案都一样，递归求解即可 #include <bits/stdc++.h> using namespace std; const int MAX...

A. Adjacent Replacements time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Mishka got an integer array aa of length nn as a birthday...

B. Polycarp's Practice time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Polycarp is practicing his problem solving skill. He has a...

C. Three Parts of the Array time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output You are given an array d1,d2,…,dnd1,d2,…,dn consisting...

A. Make a triangle! Masha has three sticks of length aa, bb and cc centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not all...

贪心 因字典序位越靠前权越大  从初始位置枚举此位后一位向后与原串比较字典序 若小则为最优 输出结束 /* Zeolim - An AC a day keeps the bug away */ //pragma GCC optimize(2) #include &lt;cstdio&gt; #include &lt;iostream&gt; #include &lt;cs...

观察易得 1.质数无1和自身外的因子 且只有本身既质又因 按题意直接一步减自身至零 2.若N是偶数则一直减2直到0 所有质数都是奇数 奇数减奇数易得偶数 再回到条件2 一步到位 所以操作次数不会太多 线筛打表 结合1 2 暴力模拟即可   /* Zeolim - An AC a day keeps the bug away */ //pragma GCC optimi...

二分搜索 推下方程把前半部分去掉 /* Zeolim - An AC a day keeps the bug away */ //pragma GCC optimize(2) #include &lt;cstdio&gt; #include &lt;iostream&gt; #include &lt;cstdlib&gt; #include &lt;cmath&gt; #inc...

Polycarp has to solve exactlynnproblems to improve his programming skill before an important programming competition. But this competition will be held very soon, most precisely, it will start ink...

A - Jzzhu and Cities 题目大意：给个图，m条普通边，k条特殊边，保证1到N的最短路上最多可以删掉几条特殊边使得最短路不变。 解法1：跑最短路后松弛一遍所有边，如果松弛时既有普通和特殊则可去掉特殊铁路。 解法2：直接重载搜索顺序使得迪杰斯特拉优先跑普通铁路，再记录总特殊条数-跑的条数即为答案。 /* Zeolim - An AC a day keeps the...