Cod sursa(job #948349)
| Utilizator | Data | 9 mai 2013 23:33:08 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
long bestsum=-int(2e9), sum=0, start=1, final, s, n, aux, k, nr=0;
int main()
{
f>>n>>k;
for (int i=1; i<=n; i++)
{
f>>s;
if (sum<0 && n-i>=k && nr>=k) sum=s, aux=i, nr=1;
else sum+=s, ++nr;
if (bestsum<sum && nr>=k)
{
bestsum=sum; start=aux; final=i;
}
}
g<<start<<" "<<final<<' '<<bestsum<<'\n';
f.close(); g.close();
return 0;
}
