Cod sursa(job #3231505)
| Utilizator | Data | 26 mai 2024 21:45:36 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#define Nmax 6000000
#define ll long long
using namespace std;
fstream f("ssm.in",ios::in);
fstream g("ssm.out",ios::out);
int n,v[Nmax];
int main()
{
int i,ii,p,q;
f>>n;
for(i=1;i<=n;i++) f>>v[i];
p=v[1];
q=v[1];
ii=1;
for(i=2;i<=n;i++){
p=max(p+v[i],v[i]);
if(p>q){
ii=i;
q=p;
}
}
g<<q;
for(i=ii;i>0 && q;i--) q-=v[i];
g<<' '<<i+1<<' '<<ii<<'\n';
return 0;
}
