Cod sursa(job #2358465)
| Utilizator | Data | 28 februarie 2019 09:29:06 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
long i,i1,max1=-2100000,x,pozi,pozj,suma=-1,sumax,n,k;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>x;
if(suma>=0)
suma+=x;
else
{
i1=i;
suma=x;
}
if(suma>max1&&i-i1+1>=k)
{
max1=suma;
pozi=i1;
pozj=i;
}
suma=suma+x;
}
if(k==n)
g<<1<<" "<<n<<sumax;
else
g<<pozi<<" "<<pozj<<" "max1;
}
