#include<bits/stdc++.h> using namespace std; // define #define execute cerr << " Time: " << fixed << setprecision(6) << (1.0 * clock() / CLOCKS_PER_SEC) << "s\n"; #define ll long long #define ii pair <int , int> #define iii pair <int , ii> #define se second #define fi first #define all(v) (v).begin() , (v).end() #define Unique(v) sort(all(v)) , v.resize(unique(all(v)) - v.begin()) #define bit(x,i) (((x) >> (i)) & 1LL) #define flip(x,i) ((x) ^ (1LL << (i))) #define ms(d,x) memset(d , x , sizeof(d)) #define exist __exist #define ends __ends #define visit visited #define left __left #define right __right #define prev __prev #define next __next #define sitingfake 1 #define orz 1 //constant const long long mod = 1e9 + 7; const long long linf = 4557430888798830399LL; const long long nlinf = -4485090715960753727LL; const int LOG = 20; const int inf = 1061109567; const int ninf = -1044266559; const int dx[] = {0 , -1 , 0 , 1}; const int dy[] = {-1 , 0 , 1 , 0}; template<typename T> bool maximize(T &a, const T &b) { if(a < b) {a = b; return 1;} return 0; } template<typename T> bool minimize(T &a, const T &b) { if(a > b) {a = b; return 1;} return 0; } void Plus(ll & a ,ll b) { b %= mod; a += b; if(a < 0) a += mod; a %= mod; return; } void Mul(ll & a, ll b) { (a *= (b % mod)) %= mod; return; } //code const int maxn = 200005; int n , q; int a[maxn]; struct query { int pos , val; int l , r; }Q[50005]; namespace sub3 { int pref[maxn] , dp[maxn] , val[maxn]; void Query(int l ,int r) { if(r - l + 1 <= 2) { if(l == r) cout << "1\n"; else if(a[l] != a[r]) cout << "2\n"; else cout << "1\n"; return; } int n = (r - l + 1); for(int i = 1; i <= n; i++) { val[i] = a[l + i - 1]; } for(int i = 1; i <= n; i++) { pref[i] = pref[i - 1] + val[i]; } for(int i = 1; i <= n; i++) dp[i] = -inf; dp[1] = 1; int ans = 2; for(int i = 2; i <= n; i++) { if(pref[i - 1] > a[i]) dp[i] = 2; int pos = -1; int left = 2 , right = i - 1; while(left <= right) { int mid = (left + right) >> 1; if(pref[i - 1] - pref[mid - 1] > a[i] && pref[i - 1] - pref[mid - 1] > a[mid - 1]) { pos = mid - 1; left = mid + 1; } else right = mid - 1; } if(pos != -1) { dp[i] = max(dp[i] , dp[pos] + 2); } if(pref[n] - pref[i] > a[i]) ans = max(ans , dp[i] + 1); } ans = max(ans , dp[n]); cout << ans << "\n"; } void solve() { for(int i = 1; i <= q; i++) { a[Q[i].pos] = Q[i].val; Query(Q[i].l , Q[i].r); } } } void solve(void) { cin >> n; for(int i = 1; i <= n; i++) { cin >> a[i]; } cin >> q; for(int i = 1; i <= q; i++) { cin >> Q[i].pos >> Q[i].val >> Q[i].l >> Q[i].r; Q[i].l++; } if(q <= 10) sub3 :: solve(); } /** **/ signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define task "" if(fopen(task".inp","r")) { freopen(task".inp","r",stdin); freopen(task".out","w",stdout); } int tc = 1; // cin >> tc; while(tc--) solve(); // execute; }

mizuyokan2.cpp: In function 'int main()':
mizuyokan2.cpp:162:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  162 |        freopen(task".inp","r",stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mizuyokan2.cpp:163:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  163 |        freopen(task".out","w",stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~