Cod sursa(job #2431808)
| Utilizator | Data | 20 iunie 2019 19:46:07 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,i,j,x,s[50005],st,dr,val,maxim,poz;
set < pair<int,int> > Set;
int main()
{
f>>n>>k;
for(i=1;i<=k-1;i++)
{
f>>x;
s[i]=s[i-1]+x;
}
j=0;
maxim=-1e9;
for(i=k;i<=n;i++)
{
f>>x;
s[i]=s[i-1]+x;
Set.insert({s[j],j});
val=(*Set.begin()).first;
poz=(*Set.begin()).second;
if(s[i]-val>maxim)
{
maxim=s[i]-val;
st=poz+1;
dr=i;
}
j++;
}
g<<st<<" "<<dr<<" "<<maxim;
return 0;
}
