結果

問題 No.193 筒の数式
ユーザー threepipes_sthreepipes_s
提出日時 2015-04-26 22:50:04
言語 Java21
(openjdk 21)
結果
AC  
実行時間 56 ms / 1,000 ms
コード長 5,094 bytes
コンパイル時間 2,930 ms
コンパイル使用メモリ 79,924 KB
実行使用メモリ 50,576 KB
最終ジャッジ日時 2024-07-05 03:12:33
合計ジャッジ時間 4,030 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
50,572 KB
testcase_01 AC 54 ms
50,576 KB
testcase_02 AC 54 ms
50,560 KB
testcase_03 AC 52 ms
50,496 KB
testcase_04 AC 56 ms
50,432 KB
testcase_05 AC 55 ms
50,488 KB
testcase_06 AC 55 ms
50,248 KB
testcase_07 AC 55 ms
50,560 KB
testcase_08 AC 55 ms
50,576 KB
testcase_09 AC 56 ms
50,052 KB
testcase_10 AC 55 ms
50,280 KB
testcase_11 AC 52 ms
50,380 KB
testcase_12 AC 56 ms
50,484 KB
testcase_13 AC 55 ms
50,480 KB
testcase_14 AC 53 ms
50,464 KB
testcase_15 AC 55 ms
50,504 KB
testcase_16 AC 55 ms
50,496 KB
testcase_17 AC 54 ms
50,424 KB
testcase_18 AC 55 ms
50,136 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Comparator;
import java.util.HashSet;
import java.util.LinkedList;

public class Main {
	public static int[][] dist;
	public static int[][] distCp;
	public static int minId;
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		ContestScanner in = new ContestScanner();
        char[] s = in.nextToken().toCharArray();
        LinkedList<Character> list = new LinkedList<Character>();
        for(int i=0; i<s.length; i++){
        	list.add(s[i]);
        }
        long res = -100000000000L;
        for(int i=0; i<s.length; i++){
        	int state = 1;
        	int oldState = 1;
        	long sum = 0;
        	long pool = 0;
        	// state:
        	// 0: 数字
        	// 1: +
        	// 2: -
        	for(Character c: list){
        		if(state > 0 && !Character.isDigit(c)){
        			break;
        		}
        		state = c=='+'?1:(c=='-'?2:0);
        		switch(state){
        		case 1:
        		case 2:
        			if(oldState==1) sum += pool;
        			else sum -= pool;
        			pool = 0;
        			oldState = state;
        			break;
        		case 0:
        			pool*=10;
        			pool += c-'0';
//        			oldState = state;
        			break;
        		}
        	}
        	if(state==1 || state==2){
            	char c = list.removeLast();
            	list.addFirst(c);
        		continue;
        	}
//        	if(state==2) sum -= pool;

			if(oldState==1) sum += pool;
			else sum -= pool;
        	if(sum > res) res = sum;
        	System.err.println(sum);
        	for(char c: list){
        		System.err.print(c);
        	}
        	System.err.println();
        	char c = list.removeLast();
        	list.addFirst(c);
        }
//        for(int i=0; i<s.length; i++){
//        	int state = 1;
//        	int oldState = 1;
//        	int sum = 0;
//        	int pool = 0;
//        	// state:
//        	// 0: 前が数字
//        	// 1: 前が+
//        	// 2: 前が-
//        	for(Character c: list){
//        		if(state > 0 && !Character.isDigit(c)) break;
//        		state = c=='+'?1:(c=='-'?2:0);
//        		switch(state){
//        		case 1:
//        		case 2:
//        			if(oldState==1) sum += pool;
//        			else sum -= pool;
//        			pool = 0;
//        			oldState = state;
//        			break;
//        		case 0:
//        			pool*=10;
//        			pool += c-'0';
////        			oldState = state;
//        			break;
//        		}
//        	}
//        	if(state==1 || state==2) continue;
////        	if(state==2) sum -= pool;
//
//			if(oldState==1) sum += pool;
//			else sum -= pool;
//        	if(sum > res) res = sum;
//        	char c = list.removeLast();
//        	list.addFirst(c);
//        }
        System.out.println(res);
        
	}
}

class Node implements Comparable<Node>{
	int id;
	HashSet<Node> edge = new HashSet<Node>();
	public Node(int id) {
		this.id = id;
	}
	public void createEdge(Node node) {
		edge.add(node);
	}
	
	@Override
	public int compareTo(Node o) {
		// TODO 自動生成されたメソッド・スタブ
		return Main.distCp[Main.minId][id]-Main.distCp[Main.minId][o.id];
	}
}

class MyComp implements Comparator<int[]> {
	final int idx;
	public MyComp(int idx){
		this.idx = idx;
	}
	public int compare(int[] a, int[] b) {
		return a[idx] - b[idx];
	}
}

class Reverse implements Comparator<Integer> {
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}


class ContestWriter {
	private PrintWriter out;

	public ContestWriter(String filename) throws IOException {
		out = new PrintWriter(new BufferedWriter(new FileWriter(filename)));
	}

	public ContestWriter() throws IOException {
		out = new PrintWriter(System.out);
	}

	public void println(String str) {
		out.println(str);
	}

	public void print(String str) {
		out.print(str);
	}

	public void close() {
		out.close();
	}
}

class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;

	public ContestScanner() throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(System.in));
	}

	public ContestScanner(String filename) throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(new FileInputStream(
				filename)));
	}

	public String nextToken() throws IOException {
		if (line == null || line.length <= idx) {
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	
	public String readLine() throws IOException{
		return reader.readLine();
	}

	public long nextLong() throws IOException, NumberFormatException {
		return Long.parseLong(nextToken());
	}

	public int nextInt() throws NumberFormatException, IOException {
		return (int) nextLong();
	}

	public double nextDouble() throws NumberFormatException, IOException {
		return Double.parseDouble(nextToken());
	}
}
0