老程序员111 - 博客园

摘要：【题目描述】给出一个长为 n 的数列，以及 n 个操作，操作涉及区间加法，区间求和。【输入格式】第一行输入一个数字 n。第二行输入 n 个数字，第 i 个数字为 ai，以空格隔开。接下来输入 n 行询问，每行输入四个数字 opt、l、r... 阅读全文

posted @ 2022-09-20 22:53 老程序员111 阅读(32) 评论(0) 推荐(0)

摘要：【题目描述】给出一个长为 n 的数列，以及 n 个操作，操作涉及区间加法，单点查值。【输入格式】第一行输入一个数字 n。第二行输入 n 个数字，第 i 个数字为 ai，以空格隔开。接下来输入 n 行询问，每行输入四个数字 opt、l、r... 阅读全文

posted @ 2022-09-20 22:53 老程序员111 阅读(37) 评论(0) 推荐(0)

摘要： Problem Description There are n piles of stones of sizes a1, a2, ..., an lying on the table in front of you. During one move y... 阅读全文

posted @ 2022-09-20 22:53 老程序员111 阅读(32) 评论(0) 推荐(0)

摘要：【概述】对于给出 n 个点 m 条边的图来说，对任意两点，从顶点 Vi 到顶点 Vj 有路径，则称 Vi 和 Vj 是连通的，两者可视为一个连通块，因此，连通块的计数本质就是求其连通分量，可采用 dfs、并查集等方法来计数而当给出的图是一二维地图时，当相邻... 阅读全文

posted @ 2022-09-20 22:53 老程序员111 阅读(356) 评论(0) 推荐(0)

摘要： Problem Description You are given two integers bb and ww. You have a chessboard of size 109×109109×109 with the top left cell a... 阅读全文

posted @ 2022-09-20 22:53 老程序员111 阅读(40) 评论(0) 推荐(0)

摘要： Problem Description The only difference between easy and hard versions is the size of the input. You are given a string ss con... 阅读全文

posted @ 2022-09-20 22:53 老程序员111 阅读(27) 评论(0) 推荐(0)

摘要： Problem Description The only difference between easy and hard versions is the size of the input. You are given a string ss con... 阅读全文

posted @ 2022-09-20 22:53 老程序员111 阅读(20) 评论(0) 推荐(0)

摘要： Problem Description nn robots have escaped from your laboratory! You have to find them as soon as possible, because these robot... 阅读全文

posted @ 2022-09-20 22:53 老程序员111 阅读(19) 评论(0) 推荐(0)

摘要： Problem Description You are given an array aa consisting of nn integers a1,a2,…,an. You want to split it into exactly kk non-em... 阅读全文

posted @ 2022-09-20 22:53 老程序员111 阅读(25) 评论(0) 推荐(0)

摘要： Problem Description Alice and Bob have received three big piles of candies as a gift. Now they want to divide these candies as ... 阅读全文

posted @ 2022-09-20 22:53 老程序员111 阅读(37) 评论(0) 推荐(0)

bianchengmao