Cod sursa(job #3315476)
| Utilizator | Data | 14 octombrie 2025 10:49:24 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#include <climits>
using namespace std;
int main()
{
ifstream cin("ssm.in");
ofstream cout("ssm.out");
long long N,sum=0,mini=0,maxi=INT_MIN,st=0,dr,nr;
cin>>N;
for(int i=1; i<=N; i++)
{
cin>>nr;
sum+=nr;
if(sum>maxi)
{
maxi=sum;
dr=i;
}
if(sum<mini)
{
mini=sum;
st=i;
}
}
cout<<maxi-mini<<' '<<st+1<<' '<<dr;
return 0;
}
