Cod sursa(job #2394198)
| Utilizator | Data | 1 aprilie 2019 13:27:18 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int x,k,s[50005],n,sm=-1250000000,pf,l;
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
{
f>>x;
s[i]=s[i-1]+x;
}
for(int i=k;i<n;i++)
for(int j=i;j<=n;j++)
{
x=s[j]-s[j-i];
if(x>sm)
{
pf=j;
sm=x;
l=i;
}
}
if(s[n]>sm)
{
pf=n;
l=n;
sm=s[n];
}
g<<pf-l+1<<" "<<pf<<" "<<sm<<'\n';
return 0;
}
