Cod sursa(job #3197269)
Utilizator | Birsasteanu Rebeca Brrtyuu | Data | 26 ianuarie 2024 12:56:39 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,i,st,dr,smax=0,stpoz=1,drpoz=1,s;
int v[6000001];
int subsecventa(int n)
{
for(i=1; i<=n; i++)
in>>v[i];
for(st=1; st<n; st++)
{
s=v[st];
for(dr=st+1; dr<=n; dr++)
{
s+=v[dr];
if(s>smax)
{
smax=s;
stpoz=st;
drpoz=dr;
}
}
}
}
int main()
{
in>>n;
subsecventa(n);
out<<smax<<' '<<stpoz<<' '<<drpoz;
in.close();
out.close();
return 0;
}