PleasantlY1的博客

+-字符串时间限制：1000 ms  |  内存限制：65535 KB难度：1 描述 Shiva得到了两个只有加号和减号的字符串，字串长度相同。Shiva一次可以把一个加号和它相邻的减号交换。他想知道最少需要多少次操作才能把第一个字符串变换成第二个字符串。你现在要去帮助他完成那个这个问题。    输入 多组测试数据每组数据有两行，每行包含一个由...

题目描述托米发现了一种新的游戏--填数字!每填写一次数字(1≤ i≤9)需要花费ai枚金币,托米总共有n枚金币.托米想知道他能得到的最大数字是多少.如果填不了请输出-1。不需要用完所有金币输入描述:第一行一个数字n,表示金币总数.第二行9个正整数,第i个数字表示填写一次数字i所需要的金币数.输出描述:输出满足条件的最大数字.示例1输入55 4...

Orz has two strings of the same length: A and B. Now she wants to transform A into an anagram of B (which means, a rearrangement of B) by changing some of its letters. The only operation the girl can ...

Natasha is planning an expedition to Mars for nn people. One of the important tasks is to provide food for each participant.The warehouse has mm daily food packages. Each package has some food type ...

Chiaki has n strings s1,s2,…,sn consisting of '(' and ')'. A string of this type is said to be balanced:+ if it is the empty string+ if A and B are balanced, AB is balanced,+ if A is balanced, (A) ...

DescriptionAssume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, loc...

题目描述在漆黑的夜里，N位旅行者来到了一座狭窄而且没有护栏的桥边。如果不借助手电筒的话，大家是无论如何也不敢过桥去的。不幸的是，N个人一共只带了一只手电筒，而桥窄得只够让两个人同时过。如果各自单独过桥的话，N人所需要的时间已知；而如果两人同时过桥，所需要的时间就是走得比较慢的那个人单独行动时所需的时间。问题是，如何设计一个方案，让这N人尽快过桥。 输入第一行是一个整数N(1<=N...