Cod sursa(job #304531)
Utilizator | Bula Ionut cosser | Data | 13 aprilie 2009 15:39:44 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
long s[1000000];
int main()
{
ifstream f ("ssm.in");
ofstream o ("ssm.out");
long i,n,nr,max,mini,j,fi;
f>>n;
mini=1000000;
max=-1000000;
for(i=1;i<=n;i++)
{ f>>nr;
s[i]=s[i-1]+nr;
if(s[i]>max)
max=s[i],j=i;
}
for(i=1;i<j;i++)
if( s[i]<mini )
mini=s[i],fi=i;
o<<max-mini<<" "<<fi+1<<" "<<j;
return 0;}