Cod sursa(job #2296456)
| Utilizator | Data | 4 decembrie 2018 18:26:38 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,k=0, maxim = 0,i,poz;
int main()
{
fin>>n>>k;
vector<int> v(n + 1), sum(n + 1);
sum[0]=-250005;
for (i=1;i<=n;i++){
fin >> v[i];
sum[i]=sum[i - 1]+v[i];
if(sum[i]>sum[maxim] && i>=k)
maxim=i;
}
sum[0]=0;
poz=maxim-k;
for(i=maxim-k-1;i>=0;i--)
if (sum[i] < sum[poz])
poz = i;
fout << poz + 1 <<" "<< maxim <<" "<< sum[maxim] - sum[poz];
return 0;
}
