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 list = new LinkedList(); for(int i=0; i 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 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{ int id; HashSet edge = new HashSet(); 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 { 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 { 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()); } }