Cod sursa(job #3357758)
| Utilizator | Data | 13 iunie 2026 13:54:01 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream cin("secvsummax.in");
ofstream cout("secvsummax.out");
int v[100001];
int main()
{
int n,i,p1,p1f,p2f,s,smax=-1;
cin>>n;
for(i=1;i<=n;i++)
cin>>v[i];
s=0;
p1=1;
for(i=1;i<=n;i++)
{
if(s<0)
{
s=0;
p1=i;
}
s+=v[i];
if(s>smax)
{
smax=s;
p1f=p1;
p2f=i;
}
}
cout<<p1f<<" "<<p2f;
return 0;
}