Cod sursa(job #3340996)
| Utilizator | Data | 17 februarie 2026 17:03:37 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int v[60000000];
int main()
{
long long n,mx=0,l,pz;
cin>>n;
for(int i=1;i<n;i++){
long longx,y;
cin>>x;
v[i]=v[i-1]+x;
///cout<<v[i]<<endl;
}
for(int i=1;i<n-1;i++){
for(int j=i+1;j<=n;j++){
if(mx<v[j]-v[i-1]){
pz=i;
l=j-1+1;
mx=v[j]-v[i-1];
}
}
}
cout<<mx<<" "<<pz<<" "<<l;
return 0;
}
