Cod sursa(job #1939008)
| Utilizator | Data | 25 martie 2017 13:18:45 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include<fstream>
#include<climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s[6000003];
int main()
{
int n,MIN=INT_MAX,a,MAX=INT_MIN,i,x,y,x1;
fin>>n;
for(i=1; i<=n; i++)
{
fin>>a;
s[i]=s[i-1]+a;
}
for(i=1; i<=n; i++)
{
if(MIN>s[i-1])
{
MIN=s[i-1];
x1=i;
}
if(s[i]-MIN>MAX)
{
MAX=s[i]-MIN;
y=i;
x=x1;
}
}
fout<<MAX<<" "<<x<<" "<<y;
}
