Cod sursa(job #1585299)
Utilizator | Data | 30 ianuarie 2016 22:04:02 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f(".in");
ofstream g(".out");
int n,v,i,s,maxi,t, inc, sf;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>v;
if(s<0)
{
s=0;
t=i;
}
s=s+v;
if(maxi<s)
{
maxi=s;
inc=t;
sf=i;
}
}
g<<maxi<<" "<<inc<<" "<<sf;
return 0;
}