随笔列表第9页 - 阿波罗2003

2017年8月15日

摘要： There are n cities and n - 1 roads in the Seven Kingdoms, each road connects two cities and we can reach any city from any other by the roads. Theon a 阅读全文

posted @ 2017-08-15 14:54 阿波罗2003 阅读(575) 评论(0) 推荐(0) 编辑

Codeforces 839B Game of the Rows - 贪心

摘要： Daenerys Targaryen has an army consisting of k groups of soldiers, the i-th group contains ai soldiers. She wants to bring her army to the other side 阅读全文

posted @ 2017-08-15 14:43 阿波罗2003 阅读(420) 评论(0) 推荐(0) 编辑

Codeforces 839A Arya and Bran

摘要： Bran and his older sister Arya are from the same house. Bran like candies so much, so Arya is going to give him some Candies. At first, Arya and Bran 阅读全文

posted @ 2017-08-15 14:29 阿波罗2003 阅读(215) 评论(0) 推荐(0) 编辑

2017年8月12日

hdu 4366 Successor - CDQ分治 - 线段树 - 树分块

摘要： Sean owns a company and he is the BOSS.The other Staff has one Superior.every staff has a loyalty and ability.Some times Sean will fire one staff.Then 阅读全文

posted @ 2017-08-12 13:39 阿波罗2003 阅读(432) 评论(0) 推荐(0) 编辑

2017年8月10日

poj 2942 Knights of the Round Table - Tarjan

摘要： Being a knight is a very attractive career: searching for the Holy Grail, saving damsels in distress, and drinking with the other knights are fun thin 阅读全文

posted @ 2017-08-10 21:14 阿波罗2003 阅读(211) 评论(0) 推荐(0) 编辑

2017年8月9日

bzoj 1093 最大半连通子图 - Tarjan - 拓扑排序 - 动态规划

摘要：一个有向图G=(V,E)称为半连通的(Semi-Connected)，如果满足：?u,v∈V，满足u→v或v→u，即对于图中任意两点u，v,存在一条u到v的有向路径或者从v到u的有向路径。若G'=(V',E')满足V'?V，E'是E中所有跟V'有关的边，则称G'是G的一个导出子图。若G'是G的导出子阅读全文

posted @ 2017-08-09 16:53 阿波罗2003 阅读(262) 评论(0) 推荐(0) 编辑

2017年8月8日

HihoCoder 1236 Scores - bitset - 分块

摘要： Kyle is a student of Programming Monkey Elementary School. Just as others, he is deeply concerned with his grades. Last month, the school held an exam 阅读全文

posted @ 2017-08-08 17:29 阿波罗2003 阅读(247) 评论(0) 推荐(0) 编辑

NOIP 车站分级 (luogu 1983 & codevs 3294 & vijos 1851) - 拓扑排序 - bitset

摘要：描述一条单向的铁路线上,依次有编号为 1, 2, ..., n 的 n 个火车站。每个火车站都有一个级别,最低为 1 级。现有若干趟车次在这条线路上行驶,每一趟都满足如下要求:如果这趟车次停靠了火车站 x,则始发站、终点站之间所有级别大于等于火车站 x 的都必须停靠。(注意:起始站和终点站自然也算阅读全文

posted @ 2017-08-08 14:02 阿波罗2003 阅读(298) 评论(0) 推荐(0) 编辑

2017年8月6日

Codeforces 825D Suitable Replacement - 贪心 - 二分答案

摘要： You are given two strings s and t consisting of small Latin letters, string s can also contain '?' characters. Suitability of string s is calculated b 阅读全文

posted @ 2017-08-06 17:40 阿波罗2003 阅读(232) 评论(0) 推荐(0) 编辑

OpenJudge cdqz/Data Structure Challenge 2 (Problem 5822) - 可持久化线段树

摘要：描述给一个空数列，有M次操作，每次操作是以下三种之一：（1）在数列后加一个数（2）求数列中某位置的值（3）撤销掉最后进行的若干次操作（1和3）输入第一行一个正整数M。接下来M行，每行开头是一个字符，若该字符为'A'，则表示一个加数操作，接下来一个整数x，表示在数列后加一个整数x；若该字阅读全文

posted @ 2017-08-06 13:21 阿波罗2003 阅读(316) 评论(0) 推荐(0) 编辑

Codeforces 834D The Bakery - 动态规划 - 线段树

摘要： Some time ago Slastyona the Sweetmaid decided to open her own bakery! She bought required ingredients and a wonder-oven which can bake several types o 阅读全文

posted @ 2017-08-06 12:06 阿波罗2003 阅读(191) 评论(0) 推荐(0) 编辑

2017年8月5日

hdu 1394 Minimum Inversion Number - 树状数组

摘要： The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i < j and ai > aj. For a given sequence o 阅读全文

posted @ 2017-08-05 17:10 阿波罗2003 阅读(140) 评论(0) 推荐(0) 编辑

Codeforces 837E Vasya's Function - 数论

摘要： Vasya is studying number theory. He has denoted a function f(a, b) such that: f(a, 0) = 0; f(a, b) = 1 + f(a, b - gcd(a, b)), where gcd(a, b) is the g 阅读全文

posted @ 2017-08-05 16:49 阿波罗2003 阅读(325) 评论(0) 推荐(0) 编辑

Codeforces 837D Round Subset - 动态规划 - 数论

摘要： Let's call the roundness of the number the number of zeros to which it ends. You have an array of n numbers. You need to choose a subset of exactly k 阅读全文

posted @ 2017-08-05 15:48 阿波罗2003 阅读(240) 评论(0) 推荐(0) 编辑

Codeforces 825E Minimal Labels - 拓扑排序 - 贪心

摘要： You are given a directed acyclic graph with n vertices and m edges. There are no self-loops or multiple edges between any pair of vertices. Graph can 阅读全文

posted @ 2017-08-05 14:16 阿波罗2003 阅读(475) 评论(0) 推荐(0) 编辑

Codeforces 437D The Child and Zoo - 树分治 - 贪心 - 并查集 - 最大生成树

摘要： Of course our child likes walking in a zoo. The zoo has n areas, that are numbered from 1 to n. The i-th area contains ai animals in it. Also there ar 阅读全文

posted @ 2017-08-05 13:42 阿波罗2003 阅读(341) 评论(0) 推荐(0) 编辑

2017年8月2日

Codeforces 799D Field expansion - 搜索 - 贪心

摘要： In one of the games Arkady is fond of the game process happens on a rectangular field. In the game process Arkady can buy extensions for his field, ea 阅读全文

posted @ 2017-08-02 15:45 阿波罗2003 阅读(243) 评论(0) 推荐(0) 编辑

2017年8月1日

Codeforces 438D The Child and Sequence - 线段树

摘要： At the children's day, the child came to Picks's house, and messed his house up. Picks was angry at him. A lot of important things were lost, in parti 阅读全文

posted @ 2017-08-01 13:52 阿波罗2003 阅读(286) 评论(0) 推荐(0) 编辑

Codeforces Round #427 (Div. 2) Problem D Palindromic characteristics (Codeforces 835D) - 记忆化搜索

摘要： Palindromic characteristics of string s with length |s| is a sequence of |s| integers, where k-th number is the total number of non-empty substrings o 阅读全文

posted @ 2017-08-01 10:58 阿波罗2003 阅读(316) 评论(0) 推荐(0) 编辑

Codeforces Round #427 (Div. 2) Problem C Star sky (Codeforces 835C) - 前缀和

摘要： The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all 阅读全文

posted @ 2017-08-01 09:33 阿波罗2003 阅读(297) 评论(0) 推荐(0) 编辑

Codeforces 835B The number on the board - 贪心

摘要： Some natural number was written on the board. Its sum of digits was not less than k. But you were distracted a bit, and someone changed this number to 阅读全文

posted @ 2017-08-01 09:22 阿波罗2003 阅读(262) 评论(0) 推荐(0) 编辑

Codeforces Round #427 (Div. 2) Problem A Key races (Codeforces 835 A)

摘要： Two boys decided to compete in text typing on the site "Key races". During the competition, they have to type a text consisting of s characters. The f 阅读全文

posted @ 2017-08-01 09:14 阿波罗2003 阅读(170) 评论(0) 推荐(0) 编辑

2017年7月31日

快速傅里叶变换学习笔记

摘要： (如果读到任何有问题的地方，请先阅读文章末尾) （这里做一个约定，下文中的$\mod n$表示对$n$取模的剩余）快速傅里叶变换(Fast Fourier Transform，简称FFT)常用于加速卷积运算(例如多项式乘法、大整数乘法)。虚数和复数当学习平方根的时候会不会出现这样一个疑问等于多阅读全文

posted @ 2017-07-31 19:38 阿波罗2003 阅读(1048) 评论(0) 推荐(0) 编辑

2017年7月30日

Codeforces 235C Cyclical Quest - 后缀自动机

摘要： Some days ago, WJMZBMR learned how to answer the query "how many times does a string x occur in a string s" quickly by preprocessing the string s. But 阅读全文

posted @ 2017-07-30 21:53 阿波罗2003 阅读(239) 评论(0) 推荐(0) 编辑

2017年7月29日

bzoj 3262 陌上花开 - CDQ分治 - 树状数组

摘要： Description 有n朵花，每朵花有三个属性：花形(s)、颜色(c)、气味(m)，又三个整数表示。现要对每朵花评级，一朵花的级别是它拥有的美丽能超过的花的数量。定义一朵花A比另一朵花B要美丽，当且仅当Sa>=Sb,Ca>=Cb,Ma>=Mb。显然，两朵花可能有同样的属性。需要统计出评出每个等级阅读全文

posted @ 2017-07-29 17:33 阿波罗2003 阅读(147) 评论(0) 推荐(0) 编辑

公告