思维
文章平均质量分 85
黑码
这个作者很懒,什么都没留下…
展开
-
leetcode 5403
5403. 有序矩阵中的第 k 个最小数组和难度困难6给你一个m* n的矩阵mat,以及一个整数k,矩阵中的每一行都以非递减的顺序排列。你可以从每一行中选出 1 个元素形成一个数组。返回所有可能数组中的第 k 个最小数组和。示例 1:输入:mat = [[1,3,11],[2,4,6]], k = 5输出:7解释:从每一行中选出一个元素,前 k 个和...转载 2020-05-03 18:25:06 · 341 阅读 · 0 评论 -
leetcode 5402(滑动窗口 + map)
5402. 绝对差不超过限制的最长连续子数组难度中等13给你一个整数数组nums,和一个表示限制的整数limit,请你返回最长连续子数组的长度,该子数组中的任意两个元素之间的绝对差必须小于或者等于limit。如果不存在满足条件的子数组,则返回0。解法1:滑动窗口 + map 因为map自动排好了最大最小值,时间复杂度 log#include <b...原创 2020-05-03 17:29:06 · 174 阅读 · 0 评论 -
codeforces D Xenia and Colorful Gems
给 t给 nr,ng,nb三种宝石数量nr个宝石的价值ng个宝石的价值nb个宝石的价值每种宝石各取一个,使 (xx-yy)^2+ (xx-zz)^2 + (yy-zz)^2 最小展开,有 2(xx + yy + zz) - 2xy - 2xz - 2yz 最小 由不等式可知 xx==yy==zz最小,答案为0则推 当xyz 差值最小的时候 答案最小 所以 分别对三种...原创 2020-04-16 11:45:43 · 241 阅读 · 0 评论 -
codeforces E2. Three Blocks Palindrome (hard version)
给你一个序列,你要可以在这些序列中进行删除操作,最后这个序列形成abaabaaba回文序列,并且a,ba,ba,b中的数字要一样,问这个的序列最长的长度是多少。分析:收尾两边同时逐一增加某字符,然后和中间相同字符个数,拼接起来,找到最大值#include <bits/stdc++.h>using namespace std;#define fi first#define...原创 2020-04-15 16:30:50 · 285 阅读 · 0 评论 -
leetcode 5383. 给 N x 3 网格图涂色的方案数
你有一个 n x 3的网格图 grid,你需要用 红,黄,绿三种颜色之一给每一个格子上色,且确保相邻格子颜色不同(也就是有相同水平边或者垂直边的格子颜色不同)。给你网格图的行数 n。请你返回给grid涂色的方案数。由于答案可能会非常大,请你返回答案对10^9 + 7取余的结果。示例 2:输入:n = 2输出:54示例 3:输入:n = 3输出:246示例...原创 2020-04-12 17:01:24 · 705 阅读 · 0 评论 -
codeforces 632C Eugene and an array
给定长度为n的序列,定义序列a为“好的”,当且仅当,a的子段中不存在sum值为0。那么根据题意,若sum[a[i]]在i前面存在,那么这样的序列只能最后一次取到sum[a[i]]的下标k以后,数量为i - k。#include <bits/stdc++.h>using namespace std;#define fi first#define se second#d...转载 2020-04-09 12:41:57 · 280 阅读 · 0 评论 -
codeforces 1332C K-Complete Word
K-Complete Wordtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputWord????sof length????nis called????k-complete if????sis a palindrome...原创 2020-04-01 14:32:04 · 418 阅读 · 1 评论 -
codeforces 1332D 构造
小明有一个动态规划程序是为了解决一个矩阵只能往右走或者往下走相与的最大值 是 dp[i][j] = max(dp[i-1][j] & a[i][j], dp[i][j - 1]&a[i][j]) ,然后说这个程序是错的,有真正的对的答案,给一个k 是 这个错误答案与正答的差值,让构造这个矩阵只要给一条有k的路,但是动态规划程序是不会走这条路的矩阵即可构造3*3 矩阵 ...原创 2020-04-01 14:04:03 · 256 阅读 · 0 评论 -
hdu 5583 Kingdom of Black and White(水题)
In the Kingdom of Black and White (KBW), there are two kinds of frogs: black frog and white frog.NowNNfrogs are standing in a line, some of them are black, the others are white. The total strength ...原创 2020-02-27 11:15:28 · 457 阅读 · 0 评论 -
hihocoder 1543 SCI表示法
时间限制:10000ms单点时限:1000ms内存限制:256MB描述每一个正整数N都能表示成若干个连续正整数的和,例如10可以表示成1+2+3+4,15可以表示成4+5+6,8可以表示成8本身。我们称这种表示方法为SCI(Sum of Consecutive Integers)表示法。 小Hi发现一个整数可能有很多种SCI表示,例如15可以表示成1+2+3+4+5,4+...原创 2020-02-10 22:04:44 · 199 阅读 · 0 评论 -
hdu 6011 lotus and characters
Lotus has nn kinds of characters,each kind of characters has a value and a amount.She wants to construct a string using some of these characters.Define the value of a string is:its first character’s va原创 2017-01-22 13:39:04 · 1105 阅读 · 3 评论 -
codeforces 392 div2 unfair poll
C. Unfair Poll time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output On the Literature lesson Sergei noticed an awful injustice, it seems that so原创 2017-01-20 20:09:19 · 520 阅读 · 0 评论 -
蓝桥 2的次幂表示
问题描述 任何一个正整数都可以用2进制表示,例如:137的2进制表示为10001001。 将这种2进制表示写成2的次幂的和的形式,令次幂高的排在前面,可得到如下表达式:137=2^7+2^3+2^0 现在约定幂次用括号来表示,即a^b表示为a(b) 此时,137可表示为:2(7)+2(3)+2(0) 进一步:7=2^2+2+2^0 (2^1用2表示) 3=2+2^原创 2017-02-12 00:53:23 · 314 阅读 · 0 评论 -
codeforces D. Innokenty and a Football League
time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Innokenty is a president of a new football league in Byteland. The first task he should do原创 2017-03-07 10:17:30 · 421 阅读 · 0 评论 -
GYM 101128 A.Promotions(dfs)
给出一张n个点的有向图表示一家有n个员工的公司的隶属图,u->v表示u是v的上司,现在老板要提拔一些人,但是规定如果一个员工被提拔,那么他的上司也要被提拔,现给出两个整数a和b表示一区间,求三个值,第一个值表示如果提拔a个人那么这n个中必须要被提拔的人数,第二个值表示如果提拔b个人那么这n个人中必须要被提拔的人数,第三个值表示就算提拔b个人也不会被提拔的人数 Input 第一行四个整数n,m原创 2017-03-28 01:38:32 · 413 阅读 · 0 评论 -
Matrices with XOR property
Imagine A is a NxM matrix with two basic properties1) Each element in the matrix is distinct and lies in the range of 1<=A[i][j]<=(N*M)2) For any two cells of the matrix, (i1,j1) and (i2,j2), if (i1^j1原创 2017-03-11 00:14:51 · 336 阅读 · 0 评论 -
codeforces Sereja and Algorithm
Sereja loves all sorts of algorithms. He has recently come up with a new algorithm, which receives a string as an input. Let’s represent the input string of the algorithm as q = q1q2… qk. The algorithm原创 2017-03-11 00:22:18 · 310 阅读 · 0 评论 -
cf 367B Sereja ans Anagrams
Sereja has two sequences a and b and number p. Sequence a consists of n integers a1, a2, …, an. Similarly, sequence b consists of m integers b1, b2, …, bm. As usual, Sereja studies the sequences he has原创 2017-03-11 00:27:59 · 402 阅读 · 0 评论 -
codeforces Coloring Brackets
Once Petya read a problem about a bracket sequence. He gave it much thought but didn’t find a solution. Today you will face it.You are given string s. It represents a correct bracket sequence. A correc原创 2017-03-11 00:31:50 · 354 阅读 · 0 评论 -
Locked Treasures(组合数学思维)uva 6873
A group of n (1 ≤ n ≤ 30) bandits hid their stolen treasure in a room. The treasure needs to be locked away until there is a need to retrieve it. Since the bandits do not trust each other, they wanted原创 2017-03-11 18:47:25 · 676 阅读 · 0 评论 -
Sheldon Numbers (暴力枚举)
一开始想到是暴力构造 但是题没读懂。还好队友读懂了。今天自己写了个 发现还挺好写的。改了几个点过了。#include <bits/stdc++.h>using namespace std;typedef long long ll;set<ll> s;void gouzao (int x,int y){ ll res=0; for(int i=0;i<x;i++)原创 2017-03-28 14:08:48 · 728 阅读 · 0 评论 -
gym 100765A Sasha vs. Kate
Problem A. Sasha vs. Kate During the regular Mars’s World Finals Subregional Programming Contest a boy Sasha lost N “Mars” bars of chocolate to a girl Kate. But for two years already Sasha does not原创 2017-04-09 12:35:13 · 347 阅读 · 0 评论 -
codeforces 414C 归并排序
这个大神写得很好 http://www.tuicool.com/articles/iau67j先复制一个思路:解法:2^n个数,可以联想到建立一棵二叉树的东西,比如 2,1,4,3就可以建成下面这样 [2,1,4,3] level 2原创 2017-04-02 11:27:34 · 678 阅读 · 0 评论 -
codeforces 154A (对 思维)
Sergey attends lessons of the N-ish language. Each lesson he receives a hometask. This time the task is to translate some sentence to the N-ish language. Sentences of the N-ish language can be represen原创 2017-04-13 23:58:26 · 407 阅读 · 0 评论 -
zoj 3785 打表找规律
It’s Saturday today, what day is it after 11 + 22 + 33 + … + NN days? 一看就是个周期 一开始没找到 后来发现是294 擦。无语#include <bits/stdc++.h>using namespace std;const int maxn=1e5+10;const int mod=1e9+7;int sum1[10原创 2017-04-30 10:30:13 · 493 阅读 · 0 评论 -
zoj 3778 Talented Chef (思维)
As we all know, Coach Gao is a talented chef, because he is able to cook M dishes in the same time. Tonight he is going to have a hearty dinner with his girlfriend at his home. Of course, Coach Gao is原创 2017-04-30 11:25:33 · 401 阅读 · 0 评论 -
codeforces Polycarp at the Radio
Polycarp is a music editor at the radio station. He received a playlist for tomorrow, that can be represented as a sequence a1, a2, …, an, where ai is a band, which performs the i-th song. Polycarp lik原创 2017-04-30 21:31:17 · 350 阅读 · 0 评论 -
codeforces Igor and his way to work
B. Igor and his way to work time limit per test3 seconds memory limit per test256 megabytes inputstandard input outputstandard output Woken up by the alarm clock Igor the financial analyst hurried原创 2017-04-24 12:09:39 · 959 阅读 · 2 评论 -
codeforces 628B New Skateboard
Max wants to buy a new skateboard. He has calculated the amount of money that is needed to buy a new skateboard. He left a calculator on the floor and went to ask some money from his parents. Meanwhile原创 2017-05-23 22:41:43 · 401 阅读 · 0 评论 -
codeforces 632C The Smallest String Concatenation 排序
You’re given a list of n strings a1, a2, …, an. You’d like to concatenate them together in some order such that the resulting string would be lexicographically smallest.Given the list of strings, outpu原创 2017-05-23 22:43:27 · 303 阅读 · 0 评论 -
codeforces 632A Grandma Laura and Apples 模拟
英文差 读得烦 简略题意:有n个人来买苹果,half 表示这个人买苹果时剩余苹果数是偶数且他买走一半,halfplus表示这个人买苹果时剩余苹果数是奇数且他买走一半 并花半价又买走一个。给定每个苹果的单价,问获得的钱。#include <bits/stdc++.h>using namespace std;const int maxn=1e5;string s[maxn];int cmp(s原创 2017-05-23 22:45:21 · 383 阅读 · 0 评论 -
codeforces 628C Bear and String Distance 水
Limak is a little polar bear. He likes nice strings — strings of length n, consisting of lowercase English letters only.The distance between two letters is defined as the difference between their posit原创 2017-05-23 22:47:14 · 294 阅读 · 0 评论 -
Alice, Bob, Two Teams codeforces 632B
Alice and Bob are playing a game. The game involves splitting up game pieces into two teams. There are n pieces, and the i-th piece has a strength pi.The way to split up game pieces is split into sever原创 2017-05-24 00:23:00 · 321 阅读 · 0 评论 -
codeforces Naming Company 很思维题最优想法
C. Naming Company time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Oleg the client and Igor the analyst are good friends. However, sometime原创 2017-05-14 00:22:27 · 975 阅读 · 0 评论 -
Longest Subsequence codeforces 632D 暴力数学
ou are given array a with n elements and the number m. Consider some subsequence of a and the value of least common multiple (LCM) of its elements. Denote LCM as l. Find any longest subsequence of a wi原创 2017-05-25 01:05:14 · 463 阅读 · 0 评论 -
codeforces 612C Replace To Make Regular Bracket Sequence 傻瓜栈 符号匹配
You are given string s consists of opening and closing brackets of four kinds <>, {}, [], (). There are two types of brackets: opening and closing. You can replace any bracket by another of the same ty原创 2017-05-17 00:56:40 · 333 阅读 · 0 评论 -
Longest k-Good Segment codeforces 616D map 简单应用
The array a with n integers is given. Let’s call the sequence of one or more consecutive elements in a segment. Also let’s call the segment k-good if it contains no more than k different values.Find an原创 2017-05-17 01:00:14 · 352 阅读 · 0 评论 -
The Labyrinth 联通分量+搜索
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with ‘.’, impassable cells are marked with ‘*’. Let’s call two e原创 2017-05-17 01:02:00 · 353 阅读 · 0 评论 -
codeforces T-Shirt Hunt(傻瓜暴力)
B. T-Shirt Hunt time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Not so long ago the Codecraft-17 contest was held on Codeforces. The top 2原创 2017-05-09 00:11:49 · 756 阅读 · 0 评论 -
codeforces 612D The Union of k-Segments (前缀和处理区间)
题意:给出数字n和k,n表示接下来将输入n个在x轴上的闭区间[li,ri],找出被包含了至少k次的点,并求由这些点组成的连续区间的数目,并使该数目最小。输出该数目并将区间从左到右(x的正方向)输出。比如样例1,给出区间[0,5],[-3,2],[3,8],那么被覆盖了至少两次的区间就是[0,2],[3,5],有两个。如果确定一个被多少次覆盖的区间。。。前缀和就可以处理。。左边界+1,右边界-1,累加原创 2017-05-18 10:34:54 · 461 阅读 · 0 评论