Submission #1177752

#TimeUsernameProblemLanguageResultExecution timeMemory
1177752rareshonourFeast (NOI19_feast)C++20
0 / 100
24 ms324 KiB
#include <fstream>

using namespace std;

ifstream cin ("feast.in");
ofstream cout ("feast.out");
int v[300001];
int main()
{
    int n,k,i,j,r;
    long long sum,maxi=-1;
    cin>>n>>k;
    for (i=1; i<=n; i++)
        cin>>v[i];
    for (i=1; i<=n; i++)
    {
        sum=0;
        for (j=i; j<=n; j++)
        {
            sum+=v[j];
            if (sum>maxi)
                maxi=sum;
        }
    }
    if (maxi<0)
        cout<<0;
    else
        cout<<maxi;
    return 0;
}
#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...