Cod sursa(job #2151588)
| Utilizator | Data | 4 martie 2018 17:35:33 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,sum,i,poz,a[50001],smax=0,inc,sf,c=0;
int main()
{f>>n>>k;sum=0;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{if(sum<0) {sum=a[i];
poz=i;
}
else sum=sum+a[i],c++;
if(smax<sum) {smax=sum;
inc=poz;
sf=i;
if(c!=k) smax=a[i];
}
if(smax<sum) smax=sum;
}
g<<inc<<" "<<sf<<" "<<smax;
return 0;
}
