fork download 
  1. /// Author : Nguyễn Thái Sơn - K18 - KHMT - UIT
  2. /// Training ICPC 2024
  3.  
  4. #include<bits/stdc++.h>
  5.  
  6. /// #pragma GCC optimize("O3,unroll-loops")
  7. /// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
  8.  
  9. #define fi first
  10. #define se second
  11. #define TASK "max"
  12. #define pb push_back
  13. #define EL cout << endl
  14. #define Ti20_ntson int main()
  15. #define in(x) cout << x << endl
  16. #define all(x) (x).begin(),(x).end()
  17. #define getbit(x, i) (((x) >> (i)) & 1)
  18. #define cntbit(x) __builtin_popcount(x)
  19. #define FOR(i,l,r) for (int i = l; i <= r; i++)
  20. #define FORD(i,l,r) for (int i = l; i >= r; i--)
  21. #define Debug(a,n) for (int i = 1; i <= n; i++) cout << a[i] << " "; cout << endl
  22.  
  23. using namespace std;
  24.  
  25. typedef long long ll;
  26. typedef vector<int> vi;
  27. typedef pair<int,int> vii;
  28. typedef unsigned long long ull;
  29. typedef vector<vector<int>> vvi;
  30. int fastMax(int x, int y) { return (((y-x)>>(32-1))&(x^y))^y; }
  31.  
  32. const int N = 5e5 + 5;
  33. const int oo = INT_MAX;
  34. const int mod = 1e9 + 7;
  35. const int d4x[4] = {-1, 0, 1, 0} , d4y[4] = {0, 1, 0, -1};
  36. const int d8x[8] = {-1, -1, 0, 1, 1, 1, 0, -1}, d8y[8] = {0, 1, 1, 1, 0, -1, -1, -1};
  37.  
  38. int n, a[N];
  39. long long pre[N], Num = 0;
  40.  
  41. inline void Read_Input() {
  42.     cin >> n;
  43.     FOR(i, 1, n) {
  44.         cin >> a[i];
  45.         pre[i] = pre[i - 1] + a[i];
  46.     }
  47.  
  48. }
  49.  
  50. inline void Solve() {
  51.     FOR(R, 1, n) {
  52.         /// dam bao max[1, R] = a[R]
  53.  
  54.         /// dam bao max[2, R] = a[R];
  55.         int vt = a[R];
  56.         int l = 1, r = R, Ans = -1;
  57.  
  58.         while (l <= r) {
  59.             int mid = (l + r) >> 1;
  60.             if (pre[R] - pre[mid - 1] < vt * 2) {
  61.                 Ans = mid;
  62.                 r = mid - 1;
  63.             }
  64.             else l = mid + 1;
  65.         }
  66.  
  67.         /// [2, 5] = dung
  68.         /// [3, 5] = dung
  69.         /// ...
  70.         /// [5, 5] = dung
  71.  
  72.         /// [Ans, R] = dung
  73.         /// [Ans + 1, R] = dung
  74.         /// ...
  75.         /// [R, R] = dung
  76.  
  77.         Num += R - Ans + 1;
  78.     }
  79.     cout << Num;
  80. }
  81.  
  82. signed main() {
  83.     freopen(TASK".INP","r",stdin);
  84.     freopen(TASK".OUT","w",stdout);
  85.     ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
  86.     int T = 1;
  87. //    cin >> T;
  88.     while (T -- ) {
  89.         Read_Input();
  90.         Solve();
  91.     }
  92. }
  93.  
  94.  
Success #stdin #stdout 0s 5324KB
comments (?)
stdin 
Standard input is empty
stdout 
Standard output is empty
https://ideone.com/La0JrC
language:
C++14 (gcc 8.3)
created:
11 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!