摘要：
package text; import java.awt.Container; import java.awt.event.MouseWheelEvent; import javax.swing.*; import java.awt.*; import javax.swing.GroupLayout.ParallelGroup; import javax.xml.crypto.Dat... 阅读全文
摘要：
1 public class text1 { 2 // TODO Auto-generated method stub 3 4 public static int Random(int number1,int number2){ 5 return (int) (number1+ Math.rando 阅读全文
摘要：
1 package text; 2 3 import java.awt.print.Book; 4 import java.lang.reflect.Array; 5 import java.security.Principal; 6 import java.sql.Date; 7 import j 阅读全文
摘要：
We all know the impressive story of Robin Hood. Robin Hood uses his archery skills and his wits to steal the money from rich, and return it to the poo 阅读全文
摘要：
Farmer John has arranged his N (1 ≤ N ≤ 5,000) cows in a row and many of them are facing forward, like good cows. Some of them are facing backward, th 阅读全文
摘要：
现在有两个长度为n的排列p和s。要求通过交换使得p变成s。交换 pipi 和 pjpj 的代价是|i-j|。要求使用最少的代价让p变成s。 Input单组测试数据。 第一行有一个整数n (1≤n≤200000)，表示排列的长度。 第二行有n个范围是1到n的整数，表示排列p。每个整数只出现一次。 第三 阅读全文
摘要：
A sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Wri 阅读全文
摘要：
Farmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. The stalls are located along a straight line at positions x1,...,xN (0 <= xi 阅读全文
摘要：
数组A和数组B，里面都有n个整数。数组C共有n^2个整数，分别是A00 * B00,A00 * B11......A11 * B00,A11 * B11......An−1n−1 * Bn−1n−1（数组A同数组B的组合）。求数组C中第K大的数。 例如：A：1 2 3，B：2 3 4。A与B组合成的 阅读全文
摘要：
You are going out for a walk, when you suddenly encounter N monsters. Each monster has a parameter called health, and the health of the i-th monster i 阅读全文