Submission #1296069

#TimeUsernameProblemLanguageResultExecution timeMemory
1296069chaitanyamehtaFeast (NOI19_feast)C++20
22 / 100
95 ms2752 KiB
// https://static.oj.uz/problem/16d3e3748d52997353f58d61d6e89b4/statement/41e54ac7d5af210510f0e15513412d0b31cf8ee951506602d2b538eca57ecab0/statement_en.pdf #include<bits/stdc++.h> using namespace std; #define int long long signed main(){ int n , k; cin>>n>>k; vector<int> a(n); for(int i = 0 ; i < n ; i++)cin>>a[i]; int best = 0 , ans = 0; for(int i = 0 ;i < n; i++){ if(ans < 0){ ans = 0; } ans+=a[i]; best = max(best , ans); } best = max(best , ans); cout<<best; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...