摘要:题目链接: Heap Partition A sequence S = {s1, s2, ..., sn} is called heapable if there exists a binary tree T with n nodes such that every node is labelled
阅读全文
摘要:题目链接: Problem: Query on the tree Time limit: 1s Mem limit: 64 MB Problem Description There is a tree with n node, labeled from 1 to n, and the root of
阅读全文
摘要:A: Anton and Polyhedrons(水题) B: Anton and Classes(水题) C: Anton and Fairy Tale(二分) 思路:m>=n时 ans=n;m<n时 前m天都能补满,第m+1天时就要开始减少了,n-m-(x+1)*x/2是m天后第x天的剩余,二分
阅读全文
摘要:A: Andryusha and Socks(模拟) B: The Meeting Place Cannot Be Changed(三分) 思路:时间关于位置是一个凹函数,直接三分求极值就行; C: Andryusha and Colored Balloons(dfs) 思路:k是最大的度数+1,然
阅读全文
摘要:A. Buy a Shovel time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. Buy a Shovel time limi
阅读全文
摘要:题目链接: Sewage Treatment 时间限制:2000ms 单点时限:2000ms 内存限制:256MB 时间限制:2000ms 单点时限:2000ms 内存限制:256MB 描述 After years of suffering, people could not tolerate th
阅读全文
摘要:题目链接: B. Searching Rectangles time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output time limit
阅读全文
摘要:题目链接: B. Maximum Value time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output time limit per tes
阅读全文
摘要:题目链接: B. Strip time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output time limit per test 1 seco
阅读全文
摘要:题目链接: A. Fight the Monster time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output time limit per
阅读全文