08 2019 档案

摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6703 给你一个数组两种操作。操作一是将pos位置的数字加上10000000;操作二是给你个r和k,问你最小的不小于k且没在数组a的[1,r]这个区间内出现过,并输出这个数。(pos,r,k均需异或上一次 阅读全文

posted @ 2019-08-29 15:46 che027 阅读(135) 评论(0) 推荐(0)

摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6638 Problem Description There are n pirate chests buried in Byteland, labeled by 1,2,…,n. The i-th che 阅读全文

posted @ 2019-08-22 16:19 che027 阅读(316) 评论(0) 推荐(0)

摘要:题目链接:https://www.luogu.org/problem/P4513 阅读全文

posted @ 2019-08-21 15:08 che027 阅读(155) 评论(0) 推荐(0)

摘要:题目链接:http://www.51nod.com/Challenge/Problem.html#problemId=1157 贪心暴力 阅读全文

posted @ 2019-08-11 11:13 che027 阅读(230) 评论(0) 推荐(0)

摘要:题目链接:https://ac.nowcoder.com/acm/contest/887/C 题目描述 The Wow village is often hit by wind and sand,the sandstorm seriously hindered the economic develo 阅读全文

posted @ 2019-08-09 21:41 che027 阅读(231) 评论(0) 推荐(0)

摘要:题目链接:https://www.luogu.org/problem/P1115 线段树求最大子段和 阅读全文

posted @ 2019-08-09 14:52 che027 阅读(185) 评论(0) 推荐(0)

摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6601 Problem Description N sticks are arranged in a row, and their lengths are a1,a2,...,aN.There are Q 阅读全文

posted @ 2019-08-03 10:59 che027 阅读(161) 评论(0) 推荐(0)

摘要:题目链接:https://www.luogu.org/problem/P3834 主席树求静态区间第k小 阅读全文

posted @ 2019-08-03 10:44 che027 阅读(106) 评论(0) 推荐(0)

摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6621 Problem Description You have an array: a1, a2, , an and you must answer for some queries.For each 阅读全文

posted @ 2019-08-03 10:39 che027 阅读(122) 评论(0) 推荐(0)

摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4417 Problem Description Mario is world-famous plumber. His “burly” figure and amazing jumping ability 阅读全文

posted @ 2019-08-03 10:25 che027 阅读(145) 评论(0) 推荐(0)

导航