結果
問題 | No.505 カードの数式2 |
ユーザー | mai |
提出日時 | 2017-04-21 23:08:09 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,837 bytes |
コンパイル時間 | 1,719 ms |
コンパイル使用メモリ | 168,736 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-14 07:18:33 |
合計ジャッジ時間 | 2,391 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,820 KB |
testcase_02 | AC | 1 ms
6,816 KB |
testcase_03 | AC | 2 ms
6,816 KB |
testcase_04 | AC | 2 ms
6,820 KB |
testcase_05 | AC | 2 ms
6,816 KB |
testcase_06 | AC | 2 ms
6,820 KB |
testcase_07 | AC | 2 ms
6,816 KB |
testcase_08 | AC | 2 ms
6,816 KB |
testcase_09 | AC | 2 ms
6,816 KB |
testcase_10 | AC | 2 ms
6,820 KB |
testcase_11 | AC | 2 ms
6,820 KB |
testcase_12 | AC | 2 ms
6,820 KB |
testcase_13 | AC | 2 ms
6,820 KB |
testcase_14 | AC | 2 ms
6,816 KB |
testcase_15 | AC | 2 ms
6,820 KB |
testcase_16 | AC | 2 ms
6,820 KB |
testcase_17 | AC | 2 ms
6,816 KB |
testcase_18 | AC | 2 ms
6,816 KB |
testcase_19 | AC | 2 ms
6,816 KB |
testcase_20 | AC | 2 ms
6,820 KB |
testcase_21 | AC | 1 ms
6,820 KB |
testcase_22 | AC | 2 ms
6,816 KB |
testcase_23 | AC | 2 ms
6,816 KB |
testcase_24 | AC | 2 ms
6,816 KB |
testcase_25 | AC | 2 ms
6,816 KB |
testcase_26 | AC | 2 ms
6,816 KB |
testcase_27 | AC | 2 ms
6,820 KB |
testcase_28 | AC | 2 ms
6,820 KB |
testcase_29 | AC | 2 ms
6,820 KB |
testcase_30 | AC | 1 ms
6,816 KB |
testcase_31 | AC | 2 ms
6,816 KB |
ソースコード
#include "bits/stdc++.h"#ifdef WINT_MIN#define __MAI#endifusing namespace std;typedef unsigned int uint;typedef long long int ll;typedef unsigned long long int ull;#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}#define debugaar(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}#define ALL(v) (v).begin(),(v).end()#define repeat(l) for(auto cnt=0;cnt<(l);++cnt)#define BIGINT 0x7FFFFFFF#define E107 1000000007llvoid printbit(int u) { if (u == 0)cout << 0; else { int s = 0, k = 0; for (; 0<u; u >>= 1, k++)s = (s << 1) | (u & 1); for (; 0<k--; s >>= 1)cout <<(s & 1); } }template<typename T1, typename T2>ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }#define TIME chrono::system_clock::now()#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())namespace {std::chrono::system_clock::time_point t;void tic() { t = TIME; }void toc() { fprintf(stderr, "TIME : %lldms\n", MILLISEC(TIME - t)); }std::chrono::system_clock::time_point tle = TIME;#ifdef __MAIvoid safe_tle(int msec) { assert(MILLISEC(TIME - tle) < msec); }#else#define safe_tle(k) ;#endif}#ifndef __MAInamespace {class MaiScanner {public:template<typename T>void input_integer(T& var) {var = 0;T sign = 1;int cc = getchar_unlocked();for (; cc<'0' || '9'<cc; cc = getchar_unlocked())if (cc == '-') sign = -1;for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())var = (var << 3) + (var << 1) + cc - '0';var = var*sign;}void ign() { getchar_unlocked(); }MaiScanner& operator>>(int& var) {input_integer<int>(var);return *this;}MaiScanner& operator>>(long long& var) {input_integer<long long>(var);return *this;}};}MaiScanner scanner;#else#define scanner cin#endifint width, height;int m, n;ll aa[100];ll mindp[100];ll maxdp[100];int main() {int i, j, k;int x, y, a, b;scanner >> n;repeat(n) {scanner >> aa[cnt];}fill(mindp, mindp + n, 1e18);fill(maxdp, maxdp + n, -1e18);mindp[0] = maxdp[0] = aa[0];for (i = 1; i < n; ++i) {ll t;t = mindp[i - 1] + aa[i];mindp[i] = min(mindp[i], t);maxdp[i] = max(maxdp[i], t);t = mindp[i - 1] - aa[i];mindp[i] = min(mindp[i], t);maxdp[i] = max(maxdp[i], t);t = mindp[i - 1] * aa[i];mindp[i] = min(mindp[i], t);maxdp[i] = max(maxdp[i], t);t = maxdp[i - 1] + aa[i];mindp[i] = min(mindp[i], t);maxdp[i] = max(maxdp[i], t);t = maxdp[i - 1] - aa[i];mindp[i] = min(mindp[i], t);maxdp[i] = max(maxdp[i], t);t = maxdp[i - 1] * aa[i];mindp[i] = min(mindp[i], t);maxdp[i] = max(maxdp[i], t);if (aa[i] != 0) {t = mindp[i - 1] / aa[i];mindp[i] = min(mindp[i], t);maxdp[i] = max(maxdp[i], t);t = maxdp[i - 1] / aa[i];mindp[i] = min(mindp[i], t);maxdp[i] = max(maxdp[i], t);}}cout << maxdp[n - 1] << endl;return 0;}