- 博客(12)
- 收藏
- 关注
RSS订阅原创 Lovers
DescriptionOne day nn girls and nn boys come to Xi’an to look for a mate . Each girl has a value a[i]a[i] , each boy has a value b[i]b[i] . Girl ii and boy jj will fall in love only if a[i]+b[j] \ge ...
2020-03-02 16:09:45
180
原创 ConneR and the A.R.C. Markland-N
DescriptionA.R.C. Markland-N is a tall building with nn floors numbered from 11 to nn. Between each two adjacent floors in the building, there is a staircase connecting them.It’s lunchtime for our s...
2020-03-02 16:09:39
219
原创 Collecting Packages
DescriptionThere is a robot in a warehouse and nn packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point (0,0)(0,0). The ii-th pa...
2020-03-02 16:09:23
196
原创 Neko Finds Grapes
题目大意Neko有n个宝箱和m个钥匙，第i个钥匙上写有整数a[i]，第j个宝箱上写有整数b[j]，只有a[i]+b[j]为奇数时才可以打开箱子，箱子和钥匙只能一 一对应，问对多打开多少个箱子？思路才开始想错了，暴力搜了半天，自己真是笨 。其实很简单的一道题。奇数+偶数=奇数，只有这一种条件才能满足二者和奇数，那么只要分别统计二者的奇偶数个数，找出奇+偶最大的就可以了。自己真是笨。#i...
2020-03-02 16:09:16
262
原创 Heist
题目大意一家商店里的键盘被抢劫了，键盘都是从某个数开始按照升序排列的，现在给出商店被抢劫后键盘的编号，求最少失窃键盘数~~（自我安慰？）~~ ？排序求一组数的相邻差值和即可#include <stdio.h>int main(){ int n; int num[1000]; int i,j,x; scanf("%d",&n); ...
2020-03-02 16:09:09
166
原创 Benches
题目大意公园里有n把长椅，第i把长椅上坐着a【i】个人，现在，会新来m个人，这m个人每人都会找一把长椅坐下。请求出来了m个人后人数最多的那把长椅上最多会有多少人？最少会有多少人？思路最大的情况，很简单那就是让来了的m个人都坐在人数最多的那个椅子上。而最小的情况，优先向人数最多的椅子以外的椅子上分担，这就像填坑一样，其实也就是让人数尽可能地平均。#include <stdio.h&g...
2020-03-02 16:08:59
221
原创 New Year Garland
DescriptionPolycarp is sad — New Year is coming in few days but there is still no snow in his city. To bring himself New Year mood, he decided to decorate his house with some garlands.The local stor...
2020-02-23 21:15:52
370
原创 Verse For Santa
DescriptionNew Year is coming! Vasya has prepared a New Year’s verse and wants to recite it in front of Santa Claus.Vasya’s verse contains nn parts. It takes aiai seconds to recite the ii-th part. V...
2020-02-23 21:15:45
377
原创 Angry Students
DescriptionIt’s a walking tour day in SIS.Winter, so tt groups of students are visiting Torzhok. Streets of Torzhok are so narrow that students have to go in a row one after another.Initially, some ...
2020-02-23 21:15:39
207
原创 大数加法（HDU6225 Little Boxes ）
DescriptionLittle boxes made of ticky-tacky.Little boxes.Little boxes.Little boxes all the same.There are a green boxes, and b pink boxes.And c blue boxes and d yellow boxes.And they are all ma...
2020-02-23 21:15:16
185
原创 最大子串和（Just Eat It! 存疑一直WA）
Descriptionhttps://codeforces.com/contest/1285/problem/B题目大意给定一串数字（有正有负），找寻其是否存在子串其和小于该串数字之和，子串不能包含所有数字。思路就是要找到其最大子串和，判断是否小于该串数字全部之和。...
2020-02-23 21:15:08
201
原创 Rearrangement
DescriptionIn a two dimensional array of integers of size 2 \times n2×n, is it possible to rearrange integers so that the sum of two adjacent elements (which are adjacent in a common row or a common ...
2020-02-23 21:14:42
209
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人