結果

問題 No.193 筒の数式
ユーザー uwiuwi
提出日時 2015-04-26 22:12:09
言語 Java21
(openjdk 21)
結果
AC  
実行時間 53 ms / 1,000 ms
コード長 3,339 bytes
コンパイル時間 3,633 ms
コンパイル使用メモリ 80,844 KB
実行使用メモリ 50,244 KB
最終ジャッジ日時 2024-07-05 02:53:38
合計ジャッジ時間 5,242 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
50,244 KB
testcase_01 AC 49 ms
37,016 KB
testcase_02 AC 50 ms
36,880 KB
testcase_03 AC 53 ms
36,784 KB
testcase_04 AC 49 ms
36,528 KB
testcase_05 AC 48 ms
36,984 KB
testcase_06 AC 50 ms
37,024 KB
testcase_07 AC 48 ms
37,024 KB
testcase_08 AC 49 ms
37,028 KB
testcase_09 AC 50 ms
37,012 KB
testcase_10 AC 48 ms
36,648 KB
testcase_11 AC 49 ms
36,988 KB
testcase_12 AC 50 ms
36,444 KB
testcase_13 AC 51 ms
36,864 KB
testcase_14 AC 48 ms
37,032 KB
testcase_15 AC 49 ms
37,024 KB
testcase_16 AC 48 ms
36,900 KB
testcase_17 AC 49 ms
37,092 KB
testcase_18 AC 49 ms
37,024 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q461 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		char[] s = ns().toCharArray();
		int n = s.length;
		long max = Long.MIN_VALUE;
		outer:
		for(int i = 0;i < n;i++){
			long sum = 0;
			long buf = 0;
			int op = 1;
			int len = 0;
			for(int j = 0, k = i;j < n;j++,k++){
				if(k == n)k = 0;
				if(s[k] >= '0' && s[k] <= '9'){
					buf = buf * 10 + s[k] - '0';
					len++;
				}else if(len > 0 && j < n-1){
					sum += op * buf;
					buf = 0;
					len = 0;
					op = s[k] == '+' ? 1 : -1;
				}else{
					continue outer;
				}
			}
			sum += op * buf;
			max = Math.max(max, sum);
		}
		out.println(max);
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new Q461().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0