Cod sursa(job #2358425)
| Utilizator | Data | 28 februarie 2019 08:51:00 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int i,j,i1,max1=-2100000,x,pozi,pozj,suma=-1,n,k;
int s[50001];
int main()
{
f>>n>>k;
for (i=1;i<=n;i++)
{
f>>x;
s[i]=s[i-1]+x;
}
for (i=k;i<=n;i++)
for (j=i-k;j>=0;j--)
if (s[i]-s[j]>max1)
{
max1=s[i]-s[j];
pozi=j+1;
pozj=i;
}
g<<pozi<<" "<<pozj<<" "<<max1;
return 0;
}
