fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<string> a;
  31.  
  32. int consistency(int n){
  33.  
  34. 	vector<int> dpMax(n+1, -LINF);
  35. 	vector<int> dpMin(n+1, LINF);
  36.  
  37. 	dpMax[0] = 1;
  38. 	dpMin[0] = 1;
  39.  
  40. 	for(int i=1; i<=n; i++){
  41. 		string opn = a[i-1];
  42.  
  43. 		char op = opn[0];
  44. 		if(op == 'N'){
  45. 			dpMax[i] = max(dpMax[i-1] , -dpMin[i-1] );
  46. 			dpMin[i] = min(dpMin[i-1] , -dpMax[i-1] );
  47. 		}
  48. 		else{
  49. 			int x = stoll(opn.substr(2));
  50.  
  51. 			if(op == '+'){
  52. 				dpMax[i] = max(dpMax[i-1] , dpMax[i-1] + x);
  53. 				dpMin[i] = min(dpMin[i-1] , dpMin[i-1] + x);
  54. 			}
  55. 			else if(op == '-'){
  56. 				dpMax[i] = max(dpMax[i-1] , dpMax[i-1] - x);
  57. 				dpMin[i] = min(dpMin[i-1] , dpMin[i-1] - x);
  58. 			}
  59. 			else if(op == '/'){
  60. 				dpMax[i] = max(dpMax[i-1] , dpMax[i-1]/x );
  61. 				dpMin[i] = min(dpMin[i-1] , dpMin[i-1]/x );
  62. 			}
  63. 			else { 
  64. 				dpMax[i] = max(dpMax[i-1] , dpMax[i-1] * x);
  65. 				dpMin[i] = min(dpMin[i-1] , dpMin[i-1] * x);
  66. 			}
  67. 		}
  68. 	}
  69.  
  70. 	return dpMax[n];
  71.  
  72. }
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81.  
  82.  
  83.  
  84.  
  85.  
  86.  
  87.  
  88. int practice(int n){
  89.  
  90.  
  91.     return 0;
  92. }
  93.  
  94.  
  95.  
  96.  
  97.  
  98. void solve() {
  99.  
  100.     int n;
  101.     cin>> n;
  102.     cin.ignore();
  103.  
  104.     a.resize(n);
  105.     for(int i=0; i<n; i++){
  106.     	string line;
  107.     	getline(cin, line);
  108.     	a[i] = line;
  109.     }
  110.  
  111.     cout << consistency(n) << endl;
  112.  
  113.  
  114. }
  115.  
  116.  
  117.  
  118.  
  119.  
  120. int32_t main() {
  121.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  122.  
  123.     int t = 1;
  124.     cin >> t;
  125.     cin.ignore();
  126.     while (t--) {
  127.         solve();
  128.     }
  129.  
  130.     return 0;
  131. }
Success #stdin #stdout 0s 5308KB
comments (?)
stdin
copy 
2
3
N
- 2
N
3
- 1
* 4
/ 2
stdout
copy 
3
4
https://ideone.com/fzvuQv
language:
C++14 (gcc 8.3)
created:
7 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!