Cod sursa(job #529867)
| Utilizator | Data | 6 februarie 2011 13:50:53 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
int s[60000005];
ifstream f("ssm.in");
ofstream g("ssm.out");
int main ()
{
int n,max=-int(2e9),min,sol1,sol2,inc,i,x;
f>>n;
for (i=1; i<=n; i++)
{
f>>x;
s[i]=s[i-1]+x;
}
min=s[1]; inc=1;
for (i=1; i<=n; i++)
{
if (s[i]-min>max)
{
max=s[i]-min;
sol1=inc+1; sol2=i;
}
if (s[i]<min) { min=s[i]; inc=i; }
}
g<<max<<" "<<sol1<<" "<<sol2;
return 0;
}
