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<int> a;
  31. vector<int> b;
  32.  
  33.  
  34.  
  35.  
  36.  
  37.  
  38. string consistency(int n){
  39.  
  40. 	vector<int> dpA(n);
  41. 	vector<int> dpB(n);
  42.  
  43. 	dpA[0] = a[0];
  44. 	dpB[0] = b[0];
  45.  
  46.  
  47. 	for(int i=1; i<n; i++){
  48.  
  49. 		dpA[i] = a[i] + dpA[i-1];
  50. 		if(i-2>=0) dpA[i] = max(dpA[i] , a[i] + dpB[i-2]);
  51.  
  52. 		dpB[i] = b[i] + dpB[i-1];
  53. 		if(i-2>=0) dpB[i] = max(dpB[i] , b[i] + dpA[i-2]);
  54. 	}
  55.  
  56. 	string ans = "";
  57. 	int curr = 0; // 0 -> A     , 1 -> B
  58.  
  59. 	if(dpA[n-1] > dpB[n-1])	curr = 0;
  60. 	else curr = 1;
  61.  
  62. 	int i = n-1;
  63. 	while(i>=0){
  64. 		if(curr == 0){
  65. 			ans.push_back('A');
  66. 			if(i-1>=0 && dpA[i] != a[i] + dpA[i-1]){
  67. 				ans.push_back('T');
  68. 				curr = 1;
  69. 				i--;
  70. 			}
  71. 		}
  72. 		else{
  73. 			ans.push_back('B');
  74. 			if(i-1>=0 && dpB[i] != b[i] + dpB[i-1]){
  75. 				ans.push_back('T');
  76. 				curr = 0;
  77. 				i--;
  78. 			}
  79. 		}
  80. 		i--;
  81. 	}
  82.  
  83. 	reverse(begin(ans), end(ans));
  84.  
  85. 	return ans;
  86. }
  87.  
  88.  
  89.  
  90.  
  91.  
  92.  
  93.  
  94.  
  95.  
  96.  
  97.  
  98.  
  99.  
  100.  
  101.  
  102. int practice(int n){
  103.  
  104.  
  105.     return 0;
  106. }
  107.  
  108.  
  109.  
  110.  
  111.  
  112. void solve() {
  113.  
  114.     int n;
  115.     cin>> n;
  116.  
  117.     a.resize(n);
  118.     b.resize(n);
  119.     for(int i=0; i<n; i++) cin >> a[i];
  120.     for(int i=0; i<n; i++) cin >> b[i];
  121.  
  122.     cout << consistency(n) << endl;
  123.  
  124. }
  125.  
  126.  
  127.  
  128.  
  129.  
  130. int32_t main() {
  131.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  132.  
  133.     int t = 1;
  134.     // cin >> t;
  135.     while (t--) {
  136.         solve();
  137.     }
  138.  
  139.     return 0;
  140. }
Success #stdin #stdout 0.01s 5284KB
comments (?)
stdin
copy 
4
2 10 3 200
50 4 30 100
stdout
copy 
BBTA
https://ideone.com/qviGiW
language:
C++14 (gcc 8.3)
created:
5 days 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!