m0_51690407的博客

C. Number of Pairstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array a of n integers. Find the number of pairs (i,j) (1≤i<j≤n) where the sum of ai+aj is greater than or equal

Baby Ehab Partitions AgainBaby Ehab was toying around with arrays. He has an array a of length n. He defines an array to be good if there’s no way to partition it into 2 subsequences such that the sum of the elements in the first is equal to the sum of th

B. AGAGA XOOORRRBaby Ehab is known for his love for a certain operation. He has an array a of length n, and he decided to keep doing the following operation on it:he picks 2 adjacent elements; he then removes them and places a single integer in their pla

EightProblem DescriptionThe 15-puzzle has been around for over 100 years; even if you don’t know it by that name, you’ve seen it. It is constructed with 15 sliding tiles, each with a number from 1 to 15 on it, and all packed into a 4 by 4 frame with one

有 N 件物品和一个容量是 V 的背包。每件物品只能使用一次。第 i 件物品的体积是 vi，价值是 wi。求解将哪些物品装入背包，可使这些物品的总体积不超过背包容量，且总价值最大。输出 字典序最小的方案。这里的字典序是指：所选物品的编号所构成的序列。物品的编号范围是 1…N。输入格式第一行两个整数，N，V，用空格隔开，分别表示物品数量和背包容积。接下来有 N 行，每行两个整数 vi,wi，用空格隔开，分别表示第 i 件物品的体积和价值。输出格式输出一行，包含若干个用空格隔开的整数，表示最优解

**连连看**Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 54105 Accepted Submission(s): 13712Problem Description“连连看”相信很多人都玩过。没玩过也没关系，下面我给大家介绍一下游戏规则：在一个棋盘中，放了很多的棋子。如果某两个相同的棋子，可以通过一条线连...

搜索：bfs:int dir[4][2]={{-1,0},{1,0},{0,1},{0,-1}};struct node{ int x,y;}void bfs(){ queue<node>q;//定义一个队列。 node start,next; start.x=dx; start.y=dy;//坐标代表起始位置。 q.push(start); while(!q.empty()) { start.x=q.front();//将队列第一个进行处理。 q.pop(

题目描述键盘输入一个高精度的正整数 NN（不超过 250250 位），去掉其中任意 kk 个数字后剩下的数字按原左右次序将组成一个新的非负整数。编程对给定的 NN 和 kk，寻找一种方案使得剩下的数字组成的新数最小。输入格式nn（高精度的正整数 )。kk（需要删除的数字个数 )。输出格式最后剩下的最小数。输入输出样例输入 #1175438 4输出 #113如果你的2和6测试数据没过的话试试这两个数据输入#2200056 2输出#25输入#310000 1