Pagini recente » Cod sursa (job #2940232) | Autentificare | Borderou de evaluare (job #1859144) | Cod sursa (job #2189014) | Cod sursa (job #304531)
Cod sursa(job #304531)
#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;}