Cod sursa(job #2712868)
Utilizator | Data | 26 februarie 2021 18:05:54 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin ("secv2.in");
ofstream fout ("secv2.out");
long long n,i,v[50002],maxi,s,d,k,j,z,sp[50002];
int main()
{
fin>>n>>k;
for (i=1;i<=n;i++)
{
fin>>v[i];
sp[i]=v[i]+sp[i-1];
}
for (i=k;i<=n;i++)
{
for (j=1;j<=n-i;j++)
for (z=j+i;z<=n;z++)
{
if (maxi<sp[z]-sp[j-1])
{
maxi=sp[z]-sp[j-1];
s=j;
d=z;
}
}
}
fout<<s<<" "<<d<<" "<<maxi;
return 0;
}