Cod sursa(job #1589029)
| Utilizator | Data | 3 februarie 2016 19:12:21 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 45 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,v[100000],s[1000000],sol=0,st,mn,x,y;
int main()
{
int i,x;
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
s[i]=s[i-1]+v[i];
if (s[i]-mn>sol)
{
x=st+1;
y=i;
sol=s[i]-mn;
}
if (s[i]<mn)
{
st=i;
mn=s[i];
}
}
g<<sol<<" "<<x<<" "<<y;
return 0;
}
