2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) A. Copying Homework
给一个数组,大小是n, 找出其中一个permutation, 使得与原数组至少n不同. 这个题不能random shuffle, 因为里面有几个case很多重复. 所以最好的就是shift一位.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 |
package readman; import net.egork.io.InputReader; import net.egork.io.OutputWriter; public class TaskA { public void solve(int testNumber, InputReader in, OutputWriter out) { int n = in.readInt(); int[] ary = in.readIntArray(n); int c = ary[0]; for(int i = 1; i < n; i++) { int t = ary[i-1]; ary[i-1] = ary[i]; ary[i] = t; } ary[n-1] = c; out.printLine(ary); } } |