Cod sursa(job #2476753)
Utilizator | Data | 19 octombrie 2019 11:20:33 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int n, v,s[6000005],mn,maxi,r,i,dr,ind,st;
int main()
{
f>>n;
f>>v;
s[1]=v;
r=s[1];
maxi=r;
for (i=2;i<=n;i++)
{
f>>v;
s[i]=s[i-1]+v;
if (s[i-1]<mn)
{
mn=s[i-1];
ind=i-1;
}
r=s[i]-mn;
if (maxi<r) {maxi=r;dr=i;st=ind+1;}
}
g<<maxi<<" "<<st<<" "<<dr;
return 0;
}