Cod sursa(job #2075404)
| Utilizator | Data | 25 noiembrie 2017 13:39:37 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int main()
{
int n, k, x, S[50010]{0}, MAX=0, di, dj;
fin >> n >> k;
for(int i=1;i<=n;i++)
{
fin >> x;
S[i]=S[i-1]+x;
}
for(int i=1;i<n;i++)
for(int j=i+k-1;j<=n;j++)
if(S[j]-S[i-1]>MAX)
MAX=S[j]-S[i-1], di=i, dj=j;
fout << di << " " << dj << " " << MAX;
return 0;
}
