Cod sursa(job #861804)
| Utilizator | Data | 21 ianuarie 2013 22:00:52 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,s[6000005];
int main()
{
int i,j;
f>>n;
int c;
for(i=1;i<=n;i++)
{
f>>c;
s[i]=s[i-1]+c;
}
int start,finish;
int min=200000;
int max=0,val=0;
for(i=1;i<=n;i++)
{
if(s[i]<min)
{min=s[i];
start=i;
val=0;
}
if(s[i]>max)
{max=s[i];
finish=i;
}
if(finish>start&&s[finish]-s[start]!=val)
val=s[finish]-s[start];
}
g<<val<<" ";
g<<start+1<<" "<<finish;
f.close();
g.close();
return 0;
}