Cod sursa(job #1706797)
| Utilizator | Data | 23 mai 2016 11:16:44 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[100001];
int main()
{
int n,i,sc=0,smax=-1,inceput,sfarsit,a;
in>>n;
for(i=1; i<=n; i++)
in>>v[i];
for(i=1; i<=n; i++)
{
if(sc<0)
{
sc=v[i];
a=i;
}
else
sc+=v[i];
if(sc>smax)
{
smax=sc;
inceput=a;
sfarsit=i;
}
}
out<<smax<<' '<<inceput<<' '<<sfarsit;
return 0;
}
