思路题
文章平均质量分 75
xiaoxiede_wo
这个作者很懒,什么都没留下…
展开
-
CodeForces - 1054C Candies Distribution
题目链接有n个人,每个人持有某数量的糖果,l[i]表示i左边的人拥有的糖果数量比他多的人数。r[i]表示i右边的人拥有糖果数量大于他的人数。给你l,r数组,让你判断题目给的l,r是否符合实际。符合实际就输出符合情况的每人个持有的糖果数量(多种输出任意)否则就no、a[i]=n-l[i]-r[i]就是这个人在这n个数中的排行,越大排行数越大。判断每个a[i]是否符合情况,即i前后的比他大...原创 2018-12-01 21:30:39 · 167 阅读 · 0 评论 -
等式(分解质因子求因子个数)
链接:https://www.nowcoder.com/acm/contest/90/F来源:牛客网时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 32768K,其他语言65536K 64bit IO Format: %lld题目描述 给定n,求1/x + 1/y = 1/n (x<=y)的解数。(x、y、n均为正整数) 输入描述:在第一行输入一个正整数T。接下来有T...原创 2018-03-26 19:24:55 · 931 阅读 · 0 评论 -
487-3279
时间限制:1000 ms | 内存限制:65535 KB 难度:2 描述 Businesses like to have memorable telephonenumbers. One way to make a telephone number memorable is to have it spell amemorabl...原创 2018-01-19 09:47:04 · 688 阅读 · 1 评论 -
A. Zebras
A. Zebrastime limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputOleg writes down the history of the days he lived. For each day he decid...原创 2018-03-20 15:03:01 · 215 阅读 · 0 评论 -
B. Anton and currency you all know
time limit per test0.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBerland, 2016. The exchange rate of currency you all know against the burle has increased so muc...原创 2018-03-29 23:01:07 · 145 阅读 · 0 评论 -
数列转换
描述有一个数列a1,a2,a3...an,每次可以从中任意选三个相邻的数ai-1 ,ai , ai+1 ,进行如下操作(此操作称为“对ai进行操作”)(ai-1,ai,ai+1)->(ai-1+ai,-ai,ai+ai+1)给定初始和目标序列,是否能通过以上操作,将初始序列转换成为目标序列?例如,初始序列(1 6 9 4 2 0)目标序列(7 -6 19 2 -6 6)可经过如下操作: (1...转载 2018-03-13 17:03:31 · 716 阅读 · 0 评论 -
A. Save Energy!
time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputJulia is going to cook a chicken in the kitchen of her dormitory. To save energy, the stove in the ...原创 2018-03-22 14:30:06 · 310 阅读 · 0 评论 -
网络的可靠性
描述A公司是全球依靠的互联网解决方案提供商,也是2010年世博会的高级赞助商。它将提供先进的网络协作技术,展示其”智能+互联“的生活概念,同时为参观者提供高品质的个人体验和互动,以”信息通信,尽情城市梦想”为主题贯穿。借助奇幻的剧场大屏幕和特效,展现信息通信技术的应用前景,通过生动形象的故事,向观众展示沟通无限制的未来社会前景。为此,A公司为世博园的N个区域建立了视频通信系统,其中每个区域建立一个...原创 2018-03-16 11:04:18 · 262 阅读 · 0 评论 -
hihocoder #1701 : 挑选子集
时间限制:10000ms单点时限:1000ms内存限制:256MB描述给定N个整数A1, A2, ... AN,小Hi希望从中选出M个整数,使得任意两个选出的整数的差都是K的倍数。 请你计算有多少种不同的选法。由于选法可能非常多,你只需要输出对1000000009取模的结果。输入第一行包含三个整数N、M和K。 第二行包含N个整数A1, A2, ... AN。 对于30%的数据,2 ≤ M ≤...原创 2018-04-02 16:02:54 · 186 阅读 · 0 评论 -
爆头(叉乘求点到直线的距离)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2799 Accepted Submission(s): 1329Problem Descriptiongameboy是一个CS高手,他最喜欢的就是扮演警察,手持M4爆土匪的头。也许这里...原创 2018-03-28 21:31:36 · 3222 阅读 · 0 评论 -
codeforces/gym/C. Traffic Light
题目链接共N道题,每道题一个痛苦值a[i],有M个替罪羊,每个替罪羊可以分担一个题目的痛苦值,一个题目的痛苦值可以由多个替罪羊分担。求替罪羊分担痛苦值的分差最少是多少?起初每道题分一个替罪羊,剩余的替罪羊,每只都遍历它在哪道题时方差减少的最多。就安排这只替罪羊参与均分这道题的痛苦值。用优先队列找到当前羊应该分派到的题目。#include<bits/stdc++.h>...原创 2018-11-17 18:14:12 · 230 阅读 · 0 评论 -
J - Straight Master Gym - 101775J (差分)
题意:纸牌顺子:连续的3张或连续的4张或连续的5张为顺子。手中的牌共有n个数字,每个数字是a[i]个,能不能把手中所有的牌都是属于顺子。[L,R]是一个顺子,就令b[L]+1,b[R+1]-1。a[i]就等于b[1]+b[2]+....+b[i],所以b[i]=a[i]-a[i-1];如果这个b数组对于每个相邻距离大于等于3的b[i] 和 b[j] (j>=i+3),如果每一对的和加...原创 2018-11-16 21:28:31 · 213 阅读 · 0 评论 -
Features Track(map)
Morgana is learning computer vision, and he likes cats, too. One day he wants to find the cat movement from a cat video. To do this, he extracts cat features in each frame. A cat feature is a two-dime...原创 2018-09-12 20:00:06 · 150 阅读 · 0 评论 -
E. Military Problem(dfs)
time limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn this problem you will have to help Berland army with organizing their command d...原创 2018-07-28 18:00:28 · 457 阅读 · 0 评论 -
C. Covered Points Count
time limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given nn segments on a coordinate line; each endpoint of every segment has integer coordin...原创 2018-07-13 18:43:19 · 414 阅读 · 0 评论 -
(多校)Distinct Values
Distinct ValuesTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3336 Accepted Submission(s): 523 Problem DescriptionChiaki has an arra...原创 2018-07-24 15:54:52 · 298 阅读 · 0 评论 -
codeforces 111B
B. Petya and Divisorstime limit per test5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Petya loves looking for numbers' divisors. One day Petya came across t...原创 2018-05-05 17:16:10 · 116 阅读 · 0 评论 -
51Nod - 1521
爱丽丝和鲍博喜欢玩一维战舰的游戏。他们在一行有n个方格的纸上玩这个游戏(也就是1×n的表格)。在游戏开始的时候,爱丽丝放k个战舰在这个表格中,并不把具体位置告诉鲍博。每一只战舰的形状是 1×a 的长方形(也就是说,战舰会占据a个连续的方格)。这些战舰不能相互重叠,也不能相接触。然后鲍博会做一系列的点名。当他点到某个格子的时候,爱丽丝会告诉他那个格子是否被某只战舰占据。如果是,就说hit,否则就说m...原创 2018-05-02 16:41:01 · 153 阅读 · 0 评论 -
Hard problem(两圆相交)
Hard problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 843 Accepted Submission(s): 527Problem Descriptioncjj is fun with math problem. O...原创 2018-04-20 10:57:25 · 428 阅读 · 0 评论 -
小猴子下落
描述 有一颗二叉树,最大深度为D,且所有叶子的深度都相同。所有结点从左到右从上到下的编号为1,2,3,·····,2的D次方减1。在结点1处放一个小猴子,它会往下跑。每个内结点上都有一个开关,初始全部关闭,当每次有小猴子跑到一个开关上时,它的状态都会改变,当到达一个内结点时,如果开关关闭,小猴子往左走,否则往右走,直到走到叶子结点。一些小猴子从结点1处开始往下跑,最后一个小猴儿会跑到哪里呢原创 2018-01-08 17:33:38 · 343 阅读 · 0 评论 -
Planning
Helen works in Metropolis airport. She is responsible for creating a departure schedule. There aren flights that must depart today, thei-th of them is planned to depart at the i-th minute of the d原创 2017-11-07 18:18:24 · 253 阅读 · 0 评论 -
- Five Dimensional Points(暴力)
ou are given set of n points in 5-dimensional space. The points are labeled from1 to n. No two points coincide.We will call point a bad if there are different points b andc, not equal to a, fr原创 2017-11-06 20:37:52 · 273 阅读 · 0 评论 -
CF 869 A. The Artful Expedient(异或)
Rock... Paper!After Karen have found the deterministic winning (losing?) strategy for rock-paper-scissors, her brother, Koyomi, comes up with a new game as a substitute. The game works as follows.A po...原创 2017-10-08 21:10:00 · 479 阅读 · 0 评论 -
Salty Fish
海边躺着一排咸鱼,一些有梦想的咸鱼成功翻身(然而没有什么卵用),一些则是继续当咸鱼。一个善良的渔夫想要帮这些咸鱼翻身,但是渔夫比较懒,所以只会从某只咸鱼开始,往一个方向,一只只咸鱼翻过去,翻转若干只后就转身离去,深藏功与名。更准确地说,渔夫会选择一个区间[L,R],改变区间内所有咸鱼的状态,至少翻转一只咸鱼。渔夫离开后想知道如果他采取最优策略,最多有多少只咸鱼成功翻身,但是咸鱼大概有十万条,所原创 2017-07-15 08:19:15 · 1028 阅读 · 1 评论 -
最大子段和
题目描述一个大小为n的数组a1到an(−10^4≤ai≤10^4)。请你找出一个连续子段,使子段长度为奇数,且子段和最大。输入第一行为T(1≤T≤5),代表数据组数。之后每组数据,第一行为n(1≤n≤10^5),代表数组长度。之后一行n个数,代表a1到an。输出每组数据输出一行,表示满足要求的子段和最大值样例输入141 2 3 4样例输出原创 2017-04-24 12:16:32 · 210 阅读 · 0 评论 -
LightOJ - 1078 Integer Divisibility (同余)
If an integer is not divisible by 2 or 5, some multiple of that number in decimal notation is a sequence of only a digit. Now you are given the number and the only allowable digit, you should report t原创 2017-05-11 21:03:40 · 161 阅读 · 0 评论 -
Friends
Alice lives in the country where people like to make friends. The friendship is bidirectional and if any two person have no less thank friends in common, they will become friends in several days. Cu原创 2017-04-16 16:13:47 · 215 阅读 · 0 评论 -
A. k-Factorization
http://codeforces.com/problemset/problem/797/AA. k-Factorizationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outp原创 2017-05-01 09:27:43 · 390 阅读 · 0 评论 -
洗牌问题
设2n张牌分别标记为1, 2, ..., n, n+1, ..., 2n,初始时这2n张牌按其标号从小到大排列。经一次洗牌后,原来的排列顺序变成n+1, 1, n+2, 2, ..., 2n, n。即前n张牌被放到偶数位置2, 4, ..., 2n,而后n张牌被放到奇数位置1, 3, ..., 2n-1。可以证明对于任何一个自然数n,经过若干次洗牌后可恢复初始状态。现在你的的任务是计算对于给定的n原创 2017-04-14 09:02:26 · 260 阅读 · 0 评论 -
Density of Power Network
ZOJ - 3708The vast power system is the most complicated man-made system and the greatest engineering innovation in the 20th century. The following diagram shows a typical 14 bus power system. In r原创 2017-04-07 17:56:18 · 224 阅读 · 0 评论 -
分蛋糕
时间限制:1 Sec内存限制:128 MiBspecial judge:No提交:43答案正确:10题目描述这天是wjh的生日,土豪的wjh美滋滋的买了一个特别大的蛋糕,但是乐极生悲,在回家的路上,wjh的蛋糕掉地上了虽然蛋糕固定的很好,但是蛋糕被震成了好几块,现在wjh的派对里已经有很多人等着分蛋糕了,爱面子的wjh不愿意将两块分开的蛋糕分给一个人,这样掉了wjh的档次·原创 2017-10-29 15:10:51 · 316 阅读 · 0 评论 -
F - Kayaking CodeForces - 863B
Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.Now the party is ready to start its jou原创 2017-10-31 19:29:20 · 282 阅读 · 0 评论 -
895B - XK Segments
time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhile Vasya finished eating his piece of pizza, the lesson has already star原创 2017-12-14 21:49:53 · 296 阅读 · 0 评论 -
HDU - 1251 统计难题
Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).Input 输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一连串的提问,每行一个提问,每个提问都是一个字符串转载 2017-12-03 21:03:53 · 700 阅读 · 1 评论 -
幸运大奖
幸运大奖时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 32768K,其他语言65536K64bit IO Format: %lld题目描述tabris实在是太穷了,为了发财,tabris去买了一张彩票,幸运地中了特别奖。特别奖是这样的,不会直接给你发钱.会给你一串二进制数s,让你在s中选择一个不大于k的区间,这个区间表示的数就是获奖者的奖金数目. t原创 2017-12-11 17:10:59 · 206 阅读 · 0 评论 -
Odds and Ends
Where do odds begin, and where do they end? Where does hope emerge, and will they ever break?Given an integer sequence a1, a2, ..., an of lengthn. Decide whether it is possible to divide it into a原创 2017-11-06 13:24:07 · 300 阅读 · 0 评论 -
B. Table Tennis
time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputn people are standing in a line to play table tennis. At first, the first原创 2017-11-05 08:28:50 · 303 阅读 · 0 评论 -
873B - Balanced Substring
You are given a string s consisting only of characters0 and 1. A substring[l, r] of s is a string slsl + 1sl + 2...sr, and its length equals tor - l + 1. A substring is called balanced if原创 2017-11-03 21:52:42 · 712 阅读 · 0 评论 -
C. K-Dominant Character
time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a string s consisting of lowercase Latin letters. Character原创 2017-11-13 12:55:24 · 419 阅读 · 0 评论 -
Pie Rules
You may have heard of the pie rule before. It states that if two people wish to fairly share a slice of pie, one person should cut the slice in half, and the other person should choose who gets which原创 2017-11-09 14:37:34 · 400 阅读 · 0 评论