Cod sursa(job #2701210)
Utilizator | Data | 30 ianuarie 2021 10:11:07 | |
---|---|---|---|
Problema | Carnati | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int i,n,m,maxim,minim,inceput,capat;
int nr[50005];
int main()
{
f>>n>>m;
capat=m;
for(i=1;i<=n;i++)
{
f>>nr[i];
nr[i]+=nr[i-1];
if(nr[i]>maxim && i>=m)
{
capat=i;
maxim=nr[i];
}
}
minim=nr[m];
inceput=1;
for(i=1;i<=capat-m+1;i++)
{
if(nr[capat]-nr[i-1]>minim)
{
minim=nr[capat]-nr[i-1];
inceput=i;
}
}
g<<inceput<<" "<<capat<<" "<<nr[capat]-nr[inceput-1];
return 0;
}