摘要：
Problem Description An array of positive integers a1, a2, ..., an is given. Let us consider its arbitrary subarray al, al + 1..... 阅读全文
posted @ 2022-09-20 22:58
老程序员111
阅读(35)
评论(0)
推荐(0)
摘要：
Problem Description Given an array of N integers indexed from 1 to N, and q queries, each in the form i j, you have to find the... 阅读全文
posted @ 2022-09-20 22:58
老程序员111
阅读(20)
评论(0)
推荐(0)
摘要：
Problem Description 作为一个生活散漫的人，小Z每天早上都要耗费很久从一堆五颜六色的袜子中找出一双来穿。终于有一天，小Z再也无法忍受这恼人的找袜子过程，于是他决定听天由命…… 具体来说，小Z把这N只袜子从1到N编号，然后从编号L到R(L... 阅读全文
posted @ 2022-09-20 22:58
老程序员111
阅读(25)
评论(0)
推荐(0)
摘要：
【概述】 莫队算法（mo's algorithm）是用来解决离线区间不修改询问问题，可以将复杂度优化到 O(n^1.5)，除去普通的莫队算法外，还有带修改的莫队、树上莫队等等。 莫队常用于维护区间答案，比如：对于一个长度为 n 的序列，给出 m 次询问，每次询... 阅读全文
posted @ 2022-09-20 22:58
老程序员111
阅读(29)
评论(0)
推荐(0)
摘要：
Problem Description liympanda, one of Ikki’s friend, likes playing games with Ikki. Today after minesweeping with Ikki and winn... 阅读全文
posted @ 2022-09-20 22:58
老程序员111
阅读(0)
评论(0)
推荐(0)
摘要：
Problem Description CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, withou... 阅读全文
posted @ 2022-09-20 22:58
老程序员111
阅读(21)
评论(0)
推荐(0)
摘要：
Problem Description Give you a string with length N, you can generate N strings by left shifts. For example let consider the st... 阅读全文
posted @ 2022-09-20 22:58
老程序员111
阅读(29)
评论(0)
推荐(0)
摘要：
Problem Description The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He w... 阅读全文
posted @ 2022-09-20 22:58
老程序员111
阅读(25)
评论(0)
推荐(0)
摘要：
Problem Description Windy has N balls of distinct weights from 1 unit to N units. Now he tries to label them with 1 to N in suc... 阅读全文
posted @ 2022-09-20 22:58
老程序员111
阅读(6)
评论(0)
推荐(0)
摘要：
转载于：https://www.jb51.net/article/170405.htm 这篇文章主要为大家详细介绍了C++实现简单射击小游戏，文中示例代码介绍的非常详细，具有一定的参考价值，感兴趣的小伙伴们可以参考一下 使用c++制作简单的横板射击小游戏，供大... 阅读全文
posted @ 2022-09-20 22:58
老程序员111
阅读(38888)
评论(3)
推荐(3)
浙公网安备 33010602011771号