Cod sursa(job #3211594)
Utilizator | Istrate Andreea Ruxandra Yuzuky | Data | 9 martie 2024 16:43:31 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
const int MAX = 1000000;
int v[MAX+1], s[MAX+1];
int main()
{
int n;
in>>n;
for(int i=0; i<n; ++i)
in>>v[i];
s[0]=v[0];
for(int i=1; i<n; ++i)
s[i]=s[i-1]+v[i];
int maxi=0, poz1, poz2;
for(int i=0; i<n; ++i)
{
for(int j=i-1; j>=0; --j)
{
if(s[i]-s[j]>maxi)
{
maxi=s[i]-s[j];
poz1=j+1;
poz2=i;
}
}
}
out<<maxi<<" "<<poz1+1<<" "<<poz2+1;
return 0;
}