Cod sursa(job #1677514)
| Utilizator | Data | 6 aprilie 2016 17:11:07 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
using namespace std;
long n,i,s[6000000],v[6000000],maxx,fin,in,pin;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
s[0]=0;
maxx=0;
pin=1;
for(i=1;i<=n;i++)
{
if(v[i]>s[i-1]+v[i]){in=i;s[i]=v[i];}
else s[i]=s[i-1]+v[i];
if(s[i]>maxx){maxx=s[i];fin=i;pin=in;}
}
g<<maxx<<" "<<pin<<" "<<fin;
f.close();
g.close();
return 0;
}
