Cod sursa(job #2826298)
Utilizator | Data | 5 ianuarie 2022 11:33:43 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout ("ssm.out");
int s[600005],n,i;
int main()
{
cin>>n;
for(i=1;i<=n;i++)
cin>>s[i];
int mx=-12000000,mn=0,nr,d,sf;
for(i=1;i<=n;i++)
{
s[i]=s[i]+s[i-1];
if(mx<s[i]-mn) {mx=s[i]-mn; nr=d+1;sf=i;}
if(mn>s[i]) {mn=s[i];d=i;}
}
cout<<mx<<" "<<nr<<" "<<sf;
return 0;
}