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. int kadane(vector<int>& a, int n){
  34.     int maxi = INT32_MIN;
  35.     int last = 0;
  36.     for(int i=0; i<n; i++){
  37.         int curr = max(a[i], last+a[i]);
  38.         last = curr;
  39.         maxi = max(maxi, curr);
  40.     }
  41.     return maxi;
  42. }
  43.  
  44.  
  45. int consistency(int n){
  46.  
  47.     vector<int> ab(n);
  48.  
  49.     int suma = 0;
  50.     for(int i=0; i<n; i++){
  51.         suma += a[i];
  52.         ab[i] = a[i]-b[i];
  53.     }
  54.  
  55.     vector<int> ba(n);
  56.  
  57.     int sumb = 0;
  58.     for(int i=0; i<n; i++){
  59.         sumb += b[i];
  60.         ba[i] = b[i]-a[i];
  61.     }
  62.  
  63.     int sum1 = kadane(ab, n);
  64.     int sum2 = kadane(ba, n);
  65.  
  66.     return max(sumb+sum1, suma+sum2);
  67.  
  68. }
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81.  
  82.  
  83.  
  84. int practice(int n){
  85.  
  86.  
  87.     return 0;
  88. }
  89.  
  90.  
  91.  
  92.  
  93.  
  94. void solve() {
  95.  
  96.     int n;
  97.     cin>> n;
  98.  
  99.     a.resize(n);
  100.     b.resize(n);
  101.     for(int i=0; i<n; i++) cin >> a[i];
  102.     for(int i=0; i<n; i++) cin >> b[i];
  103.  
  104.     cout << consistency(n) << endl;
  105.  
  106.  
  107. }
  108.  
  109.  
  110.  
  111.  
  112.  
  113. int32_t main() {
  114.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  115.  
  116.     int t = 1;
  117.     cin >> t;
  118.     while (t--) {
  119.         solve();
  120.     }
  121.  
  122.     return 0;
  123. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
3
3
60 60 60
10 90 10
5
20 40 20 70 30
50 20 50 40 20
3
7 11 13
1 1 1
2
stdout
copy 
210
220
31
https://ideone.com/x7aL3A
language:
C++14 (gcc 8.3)
created:
5 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!