猿的进化

Single boy Problem:1162 Time Limit:5000ms Memory Limit:65535K Description Today is Christmas day. There are n single boys standing in a line. They ar

NanoApe Loves Sequence  Accepts: 531  Submissions: 2481  Time Limit: 2000/1000 MS (Java/Others)  Memory Limit: 262144/131072 K (Java/Others) 问题描述 退役狗 NanoApe 滚回去学文化课啦！ 在数学课上，NanoApe 心痒痒又玩起了数列。

The All-purpose Zero Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1097    Accepted Submission(s): 271 Problem Description ?? get

C - たくさんの数式 / Many Formulas Time limit : 2sec / Memory limit : 256MB Score : 300 points Problem Statement You are given a string S consisting of digits between 1 and 9, inclusive. Yo

Ball Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 208    Accepted Submission(s): 125 Problem Description ZZX has a sequence of b

Ugly Problem Problem Description Everyone hates ugly problems. You are given a positive integer. You must represent that number by sum of palindromic numbers. A palindromic number is a positive integer such that if you write out that integer as a string

传送门 题意：有 n 个点，每个点有个权值，点与点之间可以连成线段，线段的权值就是两个端点的权值乘积。任意两个点与原点不可能在一条直线上，求一条直过原点的直线线穿过的线段的最大权值和？ 思路：我们可以想到，有一条过原点的直线，那么直线穿过的线段都是由直线两侧的点互相连线组成的线段，进一步发现线段的权值和就是两侧的点权值和的乘积。有了前面的简化，我们可以对所有的点按照斜率进行排序，从最小斜率的点开