https://oj.luyencode.net/problem/SUMSEQ

[utterances-bot]

Dãy con có tổng lớn nhất 2 - Luyện Code Online

https://oj.luyencode.net/problem/SUMSEQ

[sseu18042004]

cuongcutephomaique vs ot ko cay :)))

Xem code chưa AC :))

#include #define ll long long int #define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); #define el cout<<"\n" #define f0(i,n) for (int i=0;i>n>>q; int a[n+1]; a[0]=0; for (int i=1;i<=n;i++) { int x; cin>>x; if (x>0) { a[i]=a[i-1]+x; }else { a[i]=a[i-1]; } } while(q--) { int l,r; cin>>l>>r; cout<