Cod sursa(job #782262)
Utilizator | Data | 26 august 2012 16:00:29 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#define MAXN 6000006
#define INF 2000000000
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,a,b,s[MAXN],mn,mni,x,mx=-INF;
int main()
{
int i;
f>>n;
s[0]=0;
for(i=1;i<=n;i++){
f>>x;
s[i]=s[i-1]+x;
if(s[i]-mn>mx){
mx=s[i]-mn;
a=mni+1;
b=i;}
if(s[i]<mn){
mn=s[i];
mni=i;}}
g<<mx<<' '<<a<<' '<<b<<'\n';
f.close();
g.close();
return 0;
}