B. Little Robber Girl's Zoo（CF#359）

阿新 • • 發佈：2019-02-01

Little Robber Girl likes to scare animals in her zoo for fun. She decided to arrange the animals in a row in the order of non-decreasing height. However, the animals were so scared that they couldn't stay in the right places.

The robber girl was angry at first, but then she decided to arrange the animals herself. She repeatedly names numbers l

and r such thatr - l + 1 is even. After that animals that occupy positions between l and r inclusively are rearranged as follows: the animal at position lswaps places with the animal at position l + 1, the animal l + 2 swaps with the animal l + 3, ..., finally, the animal at position r - 1 swaps with the animal r

.

Help the robber girl to arrange the animals in the order of non-decreasing height. You should name at most 20 000 segments, since otherwise the robber girl will become bored and will start scaring the animals again.

B. Little Robber Girl's Zoo（CF#359）

Little Robber Girl likes to scare animals in her zoo for fun. She decided to arrange the animals in a row in the order of non-decreasing height. However,

HDU 5135 Little Zu Chongzhi's Triangles（貪心）

題解：貪心從大到小排序加遍歷，三個一起遍歷從大到小，如果滿足三角形條件都可以加上答案。 #include <algorithm> #include <iostream> #include <cstdlib> #include

B. Mike and Shortcuts（cf#361）

B. Mike and Shortcuts time limit per test 3 seconds memory limit per test 256 megabytes

USACO 6.5 Betsy's Tour （插頭dp）

tours print eve 出現 png lin per fine 麻煩 Betsy‘s TourDon Piele A square township has been divided up into N2 square plots (1 <= N <=

HDU 6059 17多校3 Kanade's trio（字典樹）

要求 tro none sat details num cst void stream Problem Description Give you an array A[1..n]，you need to calculate how many tuples (i,j,k)

Hotaru's problem（hdu5371+Manacher）多校7

uri ems sample onos none mes ted pro ron Hotaru‘s problem Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Jav

HDU 1247 Hat’s Words（字典樹）

ota log ted family lar line 初始 ber problems Hat’s Words Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Other

codeforces 848B - Rooter's Song（構造+幾何）

不變找到 size != targe i++ algorithm 題意 con 原題鏈接：http://codeforces.com/problemset/problem/848/B 題意：好多個人分別從x,y軸不同位置不同時間往垂直坐標軸方向移動，一旦相遇他們轉向，

Codeforces 848B Rooter's Song（分類+模擬）

continue ++i begin printf oot log http define bool 題目鏈接 Rooter‘s Song 題意有n個舞者站在x軸上或y軸上，每個人有不同的出發時間。x軸上的舞者垂直x軸正方向移動，y軸上的舞者垂直y軸正方向移動。當

leetcode 算法之馬拉松算法(Manacher's algorithm)（未完成）

馬拉松字符串 algo abc 出現回文字 acc c# 現在馬拉松算法：馬拉松算法是用來計算一個字符串中最長的回文字符串（對稱字符串，如aba abba）。首先，我們拿到一個字符串S，然後在S中的每個字符之間加#。例如：S="abcb" T="a#b#c#b"

7-26 Harry Potter's Exam（25 分）

ext quest numbers ini for each lan ng- should you In Professor McGonagall‘s class of Transfiguration, Harry Potter is learning how to

7-31 The World's Richest（25 分）

format obb lis minus vertica ranking can str you Forbes magazine publishes every year its list of billionaires based on the annual ra

【藍橋杯】第六屆國賽C語言B組 1.積分之迷（水題）

水題 urn class %d names 風鈴需要藍橋 std 小明開了個網上商店，賣風鈴。共有3個品牌：A，B，C。為了促銷，每件商品都會返固定的積分。小明開業第一天收到了三筆訂單：第一筆：3個A + 7個B + 1個C，共返積分：315第二筆：4個A + 10個

【藍橋杯】第七屆國賽C語言B組 2.湊平方數（dfs+STL）

ble 一個所有 mes char next memset target article 把0~9這10個數字，分成多個組，每個組恰好是一個平方數，這是能夠辦到的。比如：0, 36, 5948721 再比如：10985247361, 25, 63907840, 4, 28

codeforce 985C Liebig's Barrels（貪心+思維）

itl mod tdi += bre ati TP mat min Liebig‘s Barrels time limit per test 2 seconds memory limit per test 256 megabytes input standard i

pat 1116 Come on! Let's C（20 分）

reset war pat code ostream tac follow lar ear 1116 Come on! Let‘s C（20 分） "Let‘s C" is a popular and fun programming contest hosted by

Philosopher’s Walk（遞歸）

fill sta back char per big .cn content ken In Programming Land, there are several pathways called Philosopher’s Walks for philosophers to

Codechef：Little Elephant and Boxes/LEBOXES（折半搜尋）

傳送門題解：預處理一個 f i

HDU The Frog's Games（二分列舉）

問題簡述：給定一條河的寬度L、石頭的數量n、青蛙最多能跳躍的數量m以及每塊石頭距離岸邊的距離，求青蛙過河的最短步長。問題分析：只需關注當前的“利益”，跳一步跨過的石頭越多，用的總步數越少，自然滿足題意。對於這種最值問題，如果滿足“單調性”，就可以直接用二分來做： &n

【CodeForces - 255A】Greg's Workout （水題）

題幹： Greg is a beginner bodybuilder. Today the gym coach gave him the training plan. All it had was n integers a1, a2, ..., an. Thes