結果
問題 | No.193 筒の数式 |
ユーザー | Goryudyuma |
提出日時 | 2015-06-17 22:26:37 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 1,000 ms |
コード長 | 2,425 bytes |
コンパイル時間 | 1,137 ms |
コンパイル使用メモリ | 140,524 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-07-07 03:35:00 |
合計ジャッジ時間 | 1,588 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 16 |
ソースコード
#ifndef _GLIBCXX_NO_ASSERT#include <cassert>#endif#include <cctype>#include <cerrno>#include <cfloat>#include <ciso646>#include <climits>#include <clocale>#include <cmath>#include <csetjmp>#include <csignal>#include <cstdarg>#include <cstddef>#include <cstdio>#include <cstdlib>#include <cstring>#include <ctime>//#ifdef __GXX_EXPERIMENTAL_CXX0X__#include <ccomplex>#include <cfenv>#include <cinttypes>#include <cstdbool>#include <cstdint>#include <ctgmath>#include <cwchar>#include <cwctype>//#endif#include <algorithm>#include <bitset>#include <complex>#include <deque>#include <exception>#include <fstream>#include <functional>#include <iomanip>#include <ios>#include <iosfwd>#include <iostream>#include <istream>#include <iterator>#include <limits>#include <list>#include <locale>#include <map>#include <memory>#include <new>#include <numeric>#include <ostream>#include <queue>#include <set>#include <sstream>#include <stack>#include <stdexcept>#include <streambuf>#include <string>#include <typeinfo>#include <utility>#include <valarray>#include <vector>#include <array>//#include <atomic>#include <chrono>//#include <condition_variable>#include <forward_list>//#include <future>#include <initializer_list>//#include <mutex>#include <random>#include <ratio>#include <regex>#include <system_error>//#include <thread>#include <tuple>#include <typeindex>#include <type_traits>#include <unordered_map>#include <unordered_set>using namespace std;int main (){string str;cin >> str;int ans = INT_MIN;for( size_t i = 0; i < str.size ()+5; i++ ){rotate ( str.begin () , str.begin () + 1 , str.end () );if( str[0] == '+' || str[str.size () - 1] == '+' ||str[0] == '-' || str[str.size () - 1] == '-' ){continue;}int memo = 0;int res = 0;char z = '+';for( auto x : str ){switch( x ){case '+':{if( z == '+' ){res += memo;} else{res -= memo;}z = '+';memo = 0;break;}case '-':{if( z == '+' ){res += memo;} else{res -= memo;}z = '-';memo = 0;break;}default:{memo *= 10;memo += x - '0';break;}}}if( z == '+' ){res += memo;} else{res -= memo;}ans = max ( ans , res );}cout << ans << endl;}