Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
#include <vector> #include <set> #include <map> #include <iostream> using namespace std; const int maxn = 2e5 + 10; int pref_sum[maxn]; int query(int i, int j) { if(i == 0) { return pref_sum[j]; } return pref_sum[j] - pref_sum[i - 1]; } int main() { int n, k; cin >>n >> k; vector<int> v(n); int sum = 0; for(int i = 0; i < n; i++) { cin >> v[i]; sum += v[i]; pref_sum[i] = sum; } int res = 0; int S = 0; for(int i = 0; i < n; i++) { int L = i; int R = n - 1; int idx = i; while(L <= R) { int mid = (L + R) / 2; int sum = query(i, mid); if(sum <= k) { L = mid + 1; idx = max(idx, mid); } else { R = mid - 1; } } if(idx - i + 1 > res) { res = idx - i + 1; } } cout << res << endl; return 0; }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
