Cod sursa(job #2567241)
| Utilizator | Data | 3 martie 2020 16:08:26 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.83 kb |
#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
std::deque<int>dp,dn;
int main()
{
int n,k;
fin>>n>>k;
long long s=0,ma=0,pi=0,pf=0;
int x;
for(int i=1;i<=n;i++)
{
fin>>x;
if(x>=0)
{
if(x+s>=ma && pf-pi>=k-1)
{
ma=s+x;
}
if(s==0)
{
pi=i;
}
else
{
pf=i;
}
s=s+x;
}
else
{
if(s+x<0)
{
s=0;
}
else
{
s=s+x;
}
}
}
fout<<pi<<" "<<pf<<" "<<ma;
return 0;
}
