Cod sursa(job #1214383)
Utilizator | Data | 30 iulie 2014 11:02:50 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
int n, i, maxsum, minim, start, finish, poz;
int s[6000002];
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for (i=1;i<=n;i++)
f>>s[i];
maxsum=-2000000000;
for(i=1;i<=n;i++)
{
s[i]+=s[i-1];
if(s[i]-minim>maxsum)
{
maxsum=s[i]-minim;
start=poz+1;
finish=i;
}
if(s[i]<minim)
{
minim=s[i];
poz=i;
}
}
g<<maxsum<<" "<<start<<" "<<finish<<"\n";
return 0;
}