starry

摘要： D. Almost Identity Permutations D. Almost Identity Permutations A permutation p of size n is an array such that every integer from 1 to n occurs exact 阅读全文

摘要： A. Local Extrema You are given an array a. Some element of this array ai is a local minimum iff it is strictly less than both of its neighbours (that 阅读全文

摘要： A. Div. 64 Top-model Izabella participates in the competition. She wants to impress judges and show her mathematical skills. Her problem is following: 阅读全文

摘要： C. Bertown Subway The construction of subway in Bertown is almost finished! The President of Berland will visit this city soon to look at the new subw 阅读全文

摘要： A. Borya's Diagnosis It seems that Borya is seriously sick. He is going visit n doctors to find out the exact diagnosis. Each of the doctors needs the 阅读全文

摘要： A. Alex and broken contest time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output A. Alex and b 阅读全文

摘要： 题目描述 给你一个长度为n的序列，你每次可以将一个序列分割成两个连续的的子序列，分割的代价为原序列的总和。现在允许你在初始时将序列重新排列一次。问分割成n个长度为1的序列的最大总代价是多少？ 输入描述: 第一行一个数n表示原序列的长度；接下来一行n个数a_i表示原序列的第i个数。2<=n<=1000 阅读全文

摘要： 众所周知，蒜蒜是一名热爱工作的好员工，他觉得时间就是金钱，做事情总是争分夺秒。 这天晚上，蒜蒜一个人去吃晚饭。不巧的是，吃完饭以后就开始下雨了，蒜蒜并没有带雨伞出来。但是蒜蒜热爱工作，工作使他快乐，他要尽快赶回去写代码。 蒜蒜的公司在中关村，中关村这边地形复杂，有很多天桥、地下通道和马路交错在一起。 阅读全文

摘要： A. Trip For Meal Winnie-the-Pooh likes honey very much! That is why he decided to visit his friends. Winnie has got three best friends: Rabbit, Owl an 阅读全文

摘要： A. Search for Pretty Integers You are given two lists of non-zero digits. Let's call an integer pretty if its (base 10) representation has at least on 阅读全文