2112312312321321
资源文件列表:

src/
src/Main.java 1.18KB
src/Problem01_AC.java 1.21KB
src/Problem02_AC.java 34B
src/Problem03_AC.java 887B
src/Problem04_AC.java 765B
src/Problem05_AC.java 32B
src/Problem06_AC.java 795B
src/Problem07_AC.java 871B
src/Problem08_AC.java 396B
src/Problem09_AC.java 850B
src/Problem10_AC.java 802B
src/Problem11_AC.java 759B
src/Problem12_AC.java 806B
src/Problem13_AC.java 775B
src/Problem14_AC.java 605B
src/Problem15_AC_W.java 993B
src/Problem16_AC.java 968B
src/Problem17_AC.java 1.19KB
src/Problem18_AC.java 1.02KB
src/Problem19_AC_W.java 913B
src/Problem20_AC.java 1.12KB
src/Problem21_AC_W.java 726B
src/Problem22_AC.java 1KB
src/Problem23.java 3KB
src/Problem24.java 1.45KB
src/Problem25_AC.java 848B
src/Problem26_AC_W.java 529B
src/Problem27_AC_W.java 699B
src/Problem28.java 969B
src/Problem29.java 849B
src/Problem30_AC.java 1.86KB
src/Problem31_AC_W.java 1016B
src/Problem32_AC_W.java 616B
src/Problem33_AC.java 602B
src/Problem34_AC.java 666B
src/Problem35_AC.java 606B
src/Problem36_AC.java 1.21KB
src/Problem37.java 535B
src/Solution.java 726B
src/Test.java 312B
资源介绍:
2112312312321321- > specials = new ArrayList<>();
static int trackCost = 0;
static int minCost = Integer.MAX_VALUE;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
List
- > newSpecials = new ArrayList<>();
for (int i = 0; i < specials.size(); i++) {
List