Cod sursa(job #1698727)
| Utilizator | Data | 5 mai 2016 10:29:22 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int x[50002];
int main()
{
int i,n,k,s=0,maxi=-2000000,l,j,p,q;
f>>n>>k;
for(i=1;i<=n;i++)
f>>x[i];
for(i=1;i<=n;i++)
{
s=0;
for(l=i;l<=i+k-2;l++)
s=s+x[l];
for(j=i+k-1;j<=n;j++)
{
s=s+x[j];
if(s>maxi)
{
maxi=s;
p=i;
q=j;
}
}
}
g<<p<<' '<<q<<' '<<maxi;
return 0;
}
