柳婼の blog – 第88页 – 我不管，反正我最萌～

[Java] 1007. Maximum Subsequence Sum (25)-PAT甲级

1007. Maximum Subsequence Sum (25)
Given a sequence of K integers { N1, N2, …, NK }. A continuous subsequence is defined to be { Ni, Ni+1, …, Nj } where 1 <= i <= j <= K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20.

Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.

Input Specification:

Each input file contains one test case. Each case occupies two lines. The first line contains a positive integer K (<= 10000). The second line contains K numbers, separated by a space.

Output Specification:

For each test case, output in one line the largest sum, together with the first and the last numbers of the maximum subsequence. The numbers must be separated by one space, but there must be no extra space at the end of a line. In case that the maximum subsequence is not unique, output the one with the smallest indices i and j (as shown by the sample case). If all the K numbers are negative, then its maximum sum is defined to be 0, and you are supposed to output the first and the last numbers of the whole sequence.

Sample Input:
10
-10 1 2 3 4 -5 -23 3 7 -21
Sample Output:
10 1 4
题目大意：求最大连续子序列和，输出最大的和以及这个子序列的开始值和结束值。如果所有数都小于0，那么认为最大的和为0，并且输出首尾元素。

PS：感谢github用户@fs19910227提供的pull request～

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        reader.readLine();
        String[] split = reader.readLine().split(" ");
        int final_max_sum = Integer.MIN_VALUE;
        int sub_sum = 0, start_index = 0, final_start = 0, final_end = split.length - 1;
        for (int i = 0; i < split.length; i++) {
            int value = Integer.valueOf(split[i]);
            sub_sum = sub_sum + value;
            if (sub_sum >= 0) {
                if (sub_sum > final_max_sum) {
                    final_max_sum = sub_sum;

                    if (start_index != final_start) {
                        final_start = start_index;
                    }
                    final_end = i;
                }
            } else {
                sub_sum = 0;
                start_index = i + 1;
            }
        }
        if (final_max_sum < 0) {
            final_max_sum = 0;
        }
        System.out.print(final_max_sum + " ");
        System.out.print(Integer.valueOf(split[final_start]) + " ");
        System.out.println(Integer.valueOf(split[final_end]));
    }
}

import java.io.BufferedReader;

import java.io.IOException;

import java.io.InputStreamReader;

public class Main {

public static void main(String[] args) throws IOException {

BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

reader.readLine();

String[] split = reader.readLine().split(" ");

int final_max_sum = Integer.MIN_VALUE;

int sub_sum = 0, start_index = 0, final_start = 0, final_end = split.length - 1;

for (int i = 0; i < split.length; i++) {

int value = Integer.valueOf(split[i]);

sub_sum = sub_sum + value;

if (sub_sum >= 0) {

if (sub_sum > final_max_sum) {

final_max_sum = sub_sum;

if (start_index != final_start) {

final_start = start_index;

}

final_end = i;

}

} else {

sub_sum = 0;

start_index = i + 1;

}

if (final_max_sum < 0) {

final_max_sum = 0;

}

System.out.print(final_max_sum + " ");

System.out.print(Integer.valueOf(split[final_start]) + " ");

System.out.println(Integer.valueOf(split[final_end]));

}

[Java] 1008. Elevator (20)-PAT甲级

1008. Elevator (20)
The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seconds to move the elevator up one floor, and 4 seconds to move down one floor. The elevator will stay for 5 seconds at each stop.
For a given request list, you are to compute the total time spent to fulfill the requests on the list. The elevator is on the 0th floor at the beginning and does not have to return to the ground floor when the requests are fulfilled.
Input Specification:
Each input file contains one test case. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100.
Output Specification:
For each test case, print the total time on a single line.
Sample Input:
3 2 3 1
Sample Output:
41

题目：电梯从0层开始向上，给出该电梯依次按顺序停的楼层数，并且已知上升需要6秒/层，下降需要4秒/层，停下来的话需要停5秒，问走完所有需要停的楼层后总共花了多少时间～

分析：累加计算输出～

PS：感谢github用户@fs19910227提供的pull request～

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String[] split = reader.readLine().split(" ");
        int sum = 0;
        int lastFloor = 0;
        for (int i = 1; i < split.length; i++) {
            int value = Integer.valueOf(split[i]);
            int diff = value - lastFloor;
            if (diff > 0) {
                sum += diff * 6 + 5;
            } else if (diff < 0) {
                sum += -diff * 4 + 5;
            } else {
                sum += 5;
            }
            lastFloor = value;
        }
        System.out.println(sum);
    }
}

import java.io.BufferedReader;

import java.io.IOException;

import java.io.InputStreamReader;

public class Main {

public static void main(String[] args) throws IOException {

BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

String[] split = reader.readLine().split(" ");

int sum = 0;

int lastFloor = 0;

for (int i = 1; i < split.length; i++) {

int value = Integer.valueOf(split[i]);

int diff = value - lastFloor;

if (diff > 0) {

sum += diff * 6 + 5;

} else if (diff < 0) {

sum += -diff * 4 + 5;

} else {

sum += 5;

}

lastFloor = value;

}

System.out.println(sum);

}

[Java] 1006. Sign In and Sign Out (25)-PAT甲级

1006. Sign In and Sign Out (25)
At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in’s and out’s, you are supposed to find the ones who have unlocked and locked the door on that day.

Input Specification:

Each input file contains one test case. Each case contains the records for one day. The case starts with a positive integer M, which is the total number of records, followed by M lines, each in the format:

ID_number Sign_in_time Sign_out_time
where times are given in the format HH:MM:SS, and ID number is a string with no more than 15 characters.

Output Specification:

For each test case, output in one line the ID numbers of the persons who have unlocked and locked the door on that day. The two ID numbers must be separated by one space.

Note: It is guaranteed that the records are consistent. That is, the sign in time must be earlier than the sign out time for each person, and there are no two persons sign in or out at the same moment.

Sample Input:
3
CS301111 15:30:28 17:00:10
SC3021234 08:00:00 11:25:25
CS301133 21:45:00 21:58:40
Sample Output:
SC3021234 CS301133

题目大意：给出n个人的id、sign in时间、sign out时间，求最早进来的人和最早出去的人的ID～

PS：感谢github用户@fs19910227提供的pull request～

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.text.DateFormat;
import java.text.ParseException;
import java.text.SimpleDateFormat;
import java.util.Date;

public class Main {
    static class Record {
        static DateFormat format = new SimpleDateFormat("HH:mm:ss");
        String id;
        Date start;
        Date end;

        Record(String id, String start, String end) throws ParseException {
            this.id = id;
            this.start = format.parse(start);
            this.end = format.parse(end);
        }
    }

    public static void main(String[] args) throws Exception {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        int record_counts = Integer.valueOf(reader.readLine());


        String[] split = reader.readLine().split(" ");
        Record record = new Record(split[0], split[1], split[2]);
        Record earliest = record, latest = record;
        for (int i = 1; i < record_counts; i++) {
            split = reader.readLine().split(" ");
            Record newRecord = new Record(split[0], split[1], split[2]);
            if (newRecord.start.compareTo(earliest.start) < 0) {
                earliest = newRecord;
            }
            if (newRecord.end.compareTo(latest.end) > 0) {
                latest = newRecord;
            }
        }
        System.out.println(earliest.id + " " + latest.id);
    }
}

import java.io.BufferedReader;

import java.io.InputStreamReader;

import java.text.DateFormat;

import java.text.ParseException;

import java.text.SimpleDateFormat;

import java.util.Date;

public class Main {

static class Record {

static DateFormat format = new SimpleDateFormat("HH:mm:ss");

String id;

Date start;

Date end;

Record(String id, String start, String end) throws ParseException {

this.id = id;

this.start = format.parse(start);

this.end = format.parse(end);

}

public static void main(String[] args) throws Exception {

BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

int record_counts = Integer.valueOf(reader.readLine());

String[] split = reader.readLine().split(" ");

Record record = new Record(split[0], split[1], split[2]);

Record earliest = record, latest = record;

for (int i = 1; i < record_counts; i++) {

split = reader.readLine().split(" ");

Record newRecord = new Record(split[0], split[1], split[2]);

if (newRecord.start.compareTo(earliest.start) < 0) {

earliest = newRecord;

}

if (newRecord.end.compareTo(latest.end) > 0) {

latest = newRecord;

}

System.out.println(earliest.id + " " + latest.id);

}

[Java] 1005. Spell It Right (20)-PAT甲级

Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English.

Input Specification:

Each input file contains one test case. Each case occupies one line which contains an N (<= 10100).

Output Specification:

For each test case, output in one line the digits of the sum in English words. There must be one space between two consecutive words, but no extra space at the end of a line.

Sample Input:
12345
Sample Output:
one five

题目大意：给一个非负正数N，计算N的每一位相加的和，然后输出和的每一位的英文读音～

PS：感谢github用户@fs19910227提供的pull request～

import java.io.IOException;
import java.io.InputStream;

public class Main {
    static String[] words_table = new String[]{"zero",
            "one", "two", "three", "four", "five",
            "six", "seven", "eight", "nine"};

    public static void main(String[] args) throws IOException {
        InputStream reader = System.in;
        int input, sum = 0;
        while ((input = reader.read()) != '\n') {
            sum += input - 48;
        }
        char[] chars = (sum + "").toCharArray();
        for (int i = 0; i < chars.length; i++) {
            System.out.print(words_table[chars[i] - 48]);
            if (i == chars.length - 1) {
                System.out.println();
            } else {
                System.out.print(" ");
            }
        }
    }
}

import java.io.IOException;

import java.io.InputStream;

public class Main {

static String[] words_table = new String[]{"zero",

"one", "two", "three", "four", "five",

"six", "seven", "eight", "nine"};

public static void main(String[] args) throws IOException {

InputStream reader = System.in;

int input, sum = 0;

while ((input = reader.read()) != '\n') {

sum += input - 48;

}

char[] chars = (sum + "").toCharArray();

for (int i = 0; i < chars.length; i++) {

System.out.print(words_table[chars[i] - 48]);

if (i == chars.length - 1) {

System.out.println();

} else {

System.out.print(" ");

}

[Java] 1003. Emergency (25)-PAT甲级

1003. Emergency (25)
As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the length of each road between any pair of cities are marked on the map. When there is an emergency call to you from some other city, your job is to lead your men to the place as quickly as possible, and at the mean time, call up as many hands on the way as possible.

Input

Each input file contains one test case. For each test case, the first line contains 4 positive integers: N (<= 500) – the number of cities (and the cities are numbered from 0 to N-1), M – the number of roads, C1 and C2 – the cities that you are currently in and that you must save, respectively. The next line contains N integers, where the i-th integer is the number of rescue teams in the i-th city. Then M lines follow, each describes a road with three integers c1, c2 and L, which are the pair of cities connected by a road and the length of that road, respectively. It is guaranteed that there exists at least one path from C1 to C2.

Output

For each test case, print in one line two numbers: the number of different shortest paths between C1 and C2, and the maximum amount of rescue teams you can possibly gather.
All the numbers in a line must be separated by exactly one space, and there is no extra space allowed at the end of a line.

Sample Input
5 6 0 2
1 2 1 5 3
0 1 1
0 2 2
0 3 1
1 2 1
2 4 1
3 4 1
Sample Output
2 4
题目大意：n个城市m条路，每个城市有救援小组，所有的边的边权已知。给定起点和终点，求从起点到终点的最短路径条数以及最短路径上的救援小组数目之和。如果有多条就输出点权（城市救援小组数目）最大的那个~

PS：感谢github用户@fs19910227提供的pull request～

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.TreeSet;

public class Main {
    private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

    static class Road implements Comparable<Road> {
        int fromCity, toCity, distance;

        Road(int fromCity, int toCity, int distance) {
            this.fromCity = fromCity;
            this.toCity = toCity;
            this.distance = distance;
        }

        @Override
        public int compareTo(Road o) {
            int compare = distance - o.distance;
            if (compare == 0) {
                compare = toCity - o.toCity;
                return compare == 0 ? fromCity - o.fromCity : compare;
            } else {
                return compare;
            }
        }
    }

    static class Node implements Comparable<Node> {
        int id, rescueTeams = 0, roadLength = 0;

        Node(int id, int rescueTeams) {
            this.id = id;
            this.rescueTeams = rescueTeams;
        }

        @Override
        public int compareTo(Node o) {
            int compare = roadLength - o.roadLength;
            return compare == 0 ? hashCode() - o.hashCode() : compare;
        }

        @Override
        public String toString() {
            return "Node{" +
                    "id=" + id +
                    ", rescueTeams=" + rescueTeams +
                    ", roadLength=" + roadLength +
                    '}';
        }
    }

    static class CityMap {
        final int cityNumbers, start_city, end_city, roadNumbers;
        final int[] rescues;
        final LinkedList<Road>[] roads;

        CityMap() throws IOException {
            int[] ints = readLine();
            this.cityNumbers = ints[0];
            this.roadNumbers = ints[1];
            this.start_city = ints[2];
            this.end_city = ints[3];
            rescues = readLine();
            roads = new LinkedList[cityNumbers];
            for (int i = 0; i < cityNumbers; i++) {
                roads[i] = new LinkedList<>();
            }

            for (int i = 0; i < roadNumbers; i++) {
                //读入路径
                ints = readLine();
                int start = ints[0], end = ints[1], length = ints[2];
                roads[start].add(new Road(start, end, length));
                roads[end].add(new Road(end, start, length));
            }
        }
    }

    private static int[] readLine() throws IOException {
        return Arrays.stream(reader.readLine().split(" "))
                .mapToInt(Integer::valueOf)
                .toArray();
    }

    public static void main(String[] args) throws IOException {
        final CityMap cityMap = new CityMap();
        final int start_city = cityMap.start_city;
        final int end_city = cityMap.end_city;
        int[] rescues = cityMap.rescues;

        boolean[] visited = new boolean[cityMap.cityNumbers];
        TreeSet<Node> nodes = new TreeSet<>();
        nodes.add(new Node(start_city, rescues[start_city]));
        int max_counts = 0;
        int max_rescue_teams = 0;
        int min_load_length = Integer.MAX_VALUE;
        while (!nodes.isEmpty()) {
            Node node = nodes.pollFirst();
            visited[node.id] = true;
            if (node.roadLength > min_load_length) break;
            if (node.id == end_city) {
                min_load_length = node.roadLength;
                max_counts++;
                max_rescue_teams = Math.max(max_rescue_teams, node.rescueTeams);
            }
            for (Road road : cityMap.roads[node.id]) {
                if (!visited[road.toCity]) {
                    Node newNode = new Node(road.toCity, node.rescueTeams + rescues[road.toCity]);
                    newNode.roadLength = node.roadLength + road.distance;
                    nodes.add(newNode);
                }
            }
        }

        System.out.println(max_counts + " " + max_rescue_teams);
    }
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

import java.io.BufferedReader;

import java.io.IOException;

import java.io.InputStreamReader;

import java.util.Arrays;

import java.util.LinkedList;

import java.util.TreeSet;

public class Main {

private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

static class Road implements Comparable<Road> {

int fromCity, toCity, distance;

Road(int fromCity, int toCity, int distance) {

this.fromCity = fromCity;

this.toCity = toCity;

this.distance = distance;

}

@Override

public int compareTo(Road o) {

int compare = distance - o.distance;

if (compare == 0) {

compare = toCity - o.toCity;

return compare == 0 ? fromCity - o.fromCity : compare;

} else {

return compare;

}

static class Node implements Comparable<Node> {

int id, rescueTeams = 0, roadLength = 0;

Node(int id, int rescueTeams) {

this.id = id;

this.rescueTeams = rescueTeams;

}

@Override

public int compareTo(Node o) {

int compare = roadLength - o.roadLength;

return compare == 0 ? hashCode() - o.hashCode() : compare;

}

@Override

public String toString() {

return "Node{" +

"id=" + id +

", rescueTeams=" + rescueTeams +

", roadLength=" + roadLength +

'}';

}

static class CityMap {

final int cityNumbers, start_city, end_city, roadNumbers;

final int[] rescues;

final LinkedList<Road>[] roads;

CityMap() throws IOException {

int[] ints = readLine();

this.cityNumbers = ints[0];

this.roadNumbers = ints[1];

this.start_city = ints[2];

this.end_city = ints[3];

rescues = readLine();

roads = new LinkedList[cityNumbers];

for (int i = 0; i < cityNumbers; i++) {

roads[i] = new LinkedList<>();

}

for (int i = 0; i < roadNumbers; i++) {

//读入路径

ints = readLine();

int start = ints[0], end = ints[1], length = ints[2];

roads[start].add(new Road(start, end, length));

roads[end].add(new Road(end, start, length));

}

private static int[] readLine() throws IOException {

return Arrays.stream(reader.readLine().split(" "))

.mapToInt(Integer::valueOf)

.toArray();

}

public static void main(String[] args) throws IOException {

final CityMap cityMap = new CityMap();

final int start_city = cityMap.start_city;

final int end_city = cityMap.end_city;

int[] rescues = cityMap.rescues;

boolean[] visited = new boolean[cityMap.cityNumbers];

TreeSet<Node> nodes = new TreeSet<>();

nodes.add(new Node(start_city, rescues[start_city]));

int max_counts = 0;

int max_rescue_teams = 0;

int min_load_length = Integer.MAX_VALUE;

while (!nodes.isEmpty()) {

Node node = nodes.pollFirst();

visited[node.id] = true;

if (node.roadLength > min_load_length) break;

if (node.id == end_city) {

min_load_length = node.roadLength;

max_counts++;

max_rescue_teams = Math.max(max_rescue_teams, node.rescueTeams);

}

for (Road road : cityMap.roads[node.id]) {

if (!visited[road.toCity]) {

Node newNode = new Node(road.toCity, node.rescueTeams + rescues[road.toCity]);

newNode.roadLength = node.roadLength + road.distance;

nodes.add(newNode);

}

System.out.println(max_counts + " " + max_rescue_teams);

}

[Java] 1002. A+B for Polynomials (25)-PAT甲级

This time, you are supposed to find A+B where A and B are two polynomials.

Input
Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial: K N1 aN1 N2 aN2 … NK aNK, where K is the number of nonzero terms in the polynomial, Ni and aNi (i=1, 2, …, K) are the exponents and coefficients, respectively. It is given that 1 <= K <= 10，0 <= NK < … < N2 < N1 <=1000.

Output
For each test case you should output the sum of A and B in one line, with the same format as the input. Notice that there must be NO extra space at the end of each line. Please be accurate to 1 decimal place.

Sample Input
2 1 2.4 0 3.2
2 2 1.5 1 0.5
Sample Output
3 2 1.5 1 2.9 0 3.2

题目大意：计算A+B的和，A和B都是多项式

PS：感谢github用户@fs19910227提供的pull request～

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    static class Polynomial {
        private static int MAX_SIZE = 1001;
        private double[] coefficients;

        Polynomial(String[] splits) {
            coefficients = new double[MAX_SIZE];
            for (int i = 1; i < splits.length; i += 2) {
                int exp = Integer.valueOf(splits[i]);
                coefficients[exp] = Double.valueOf(splits[i + 1]);
            }
        }

        Polynomial() {
            coefficients = new double[MAX_SIZE];
        }

        public Polynomial add(Polynomial other) {
            Polynomial result = new Polynomial();
            for (int i = 0; i < MAX_SIZE; i++) {
                double v = this.coefficients[i] + other.coefficients[i];
                v = Math.round(v * 10) / 10.0;
                if (v != 0.0) {
                    result.coefficients[i] = v;
                }
            }
            return result;
        }

        @Override
        public String toString() {
            StringBuilder stringBuilder = new StringBuilder();
            int size = 0;
            for (int i = coefficients.length - 1; i >= 0; i--) {
                double v = coefficients[i];
                if (v != 0.0) {
                    stringBuilder.append(i).append(" ").append(v).append(" ");
                    size++;
                }
            }
            stringBuilder.insert(0, size + " ");
            stringBuilder.deleteCharAt(stringBuilder.length() - 1);
            return stringBuilder.toString();
        }
    }

    private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

    public static String[] readLine() throws IOException {
        return reader.readLine().split(" ");
    }

    public static void main(String[] args) throws IOException {
        Polynomial add = new Polynomial(readLine()).add(new Polynomial(readLine()));
        System.out.println(add);
    }
}

import java.io.BufferedReader;

import java.io.IOException;

import java.io.InputStreamReader;

public class Main {

static class Polynomial {

private static int MAX_SIZE = 1001;

private double[] coefficients;

Polynomial(String[] splits) {

coefficients = new double[MAX_SIZE];

for (int i = 1; i < splits.length; i += 2) {

int exp = Integer.valueOf(splits[i]);

coefficients[exp] = Double.valueOf(splits[i + 1]);

}

Polynomial() {

coefficients = new double[MAX_SIZE];

}

public Polynomial add(Polynomial other) {

Polynomial result = new Polynomial();

for (int i = 0; i < MAX_SIZE; i++) {

double v = this.coefficients[i] + other.coefficients[i];

v = Math.round(v * 10) / 10.0;

if (v != 0.0) {

result.coefficients[i] = v;

}

return result;

}

@Override

public String toString() {

StringBuilder stringBuilder = new StringBuilder();

int size = 0;

for (int i = coefficients.length - 1; i >= 0; i--) {

double v = coefficients[i];

if (v != 0.0) {

stringBuilder.append(i).append(" ").append(v).append(" ");

size++;

}

stringBuilder.insert(0, size + " ");

stringBuilder.deleteCharAt(stringBuilder.length() - 1);

return stringBuilder.toString();

}

private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

public static String[] readLine() throws IOException {

return reader.readLine().split(" ");

}

public static void main(String[] args) throws IOException {

Polynomial add = new Polynomial(readLine()).add(new Polynomial(readLine()));

System.out.println(add);

}