Cod sursa(job #1200160)
Utilizator | Data | 22 iunie 2014 00:02:37 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int s[6000001],i,t,mx,sm,n,x,y;
int main()
{
f>>n;
for(i=1;i<=n;i++)f>>s[i];
for(mx=-9999999,i=1;i<=n;i++)
{
s[i]+=s[i-1];
if(mx<s[i]-sm)mx=s[i]-sm,x=t,y=i;
if(sm>s[i])sm=s[i],t=i+1;
}
g<<mx<<' '<<x<<' '<<y;
return 0;
}