Cod sursa(job #2431717)
| Utilizator | Data | 20 iunie 2019 17:45:31 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream in ("secv2.in");
ofstream out ("secv2.out");
int s[50001],v[50001];
int main()
{
int n,k,i,j;
in >> n >> k;
for(i=1;i<=n;i++)
{
in >> v[i];
s[i]=s[i-1]+v[i];
}
int suma,maxi=0,ls=0,ld=0;
for(j=k;j<n;j++)
{
for(i=1;i<=n-j;i++)
{
suma=s[i+j]-s[i];
if(suma>maxi)
{
ls=i+1;
ld=j+i;
maxi=suma;
}
}
}
out << ls << " " << ld << " " << maxi;
return 0;
}
