Cod sursa(job #1954914)
Utilizator | Clodnischi Darian Antonio darian2001 | Data | 5 aprilie 2017 18:48:45 |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int main()
{
short numere[50001];
long long suma[50001],n,smax=-2e15,beg,fin,k;
f>>n>>k>>numere[1];
suma[1]=numere[1];
for(int i=2;i<=n;i++)
f>>numere[i],suma[i]=suma[i-1]+numere[i];
for(int i=1;i<=n;i++)
for(int j=i+k-1;j<=n;j++)
if((suma[j]-suma[i])>smax)smax=(suma[j]-suma[i]),beg=i,fin=j;
g<<smax<<" "<<beg<<" "<<fin;
}