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