Cod sursa(job #3309756)
| Utilizator | Data | 8 septembrie 2025 14:53:17 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream cin ("secv2.in");
ofstream cout ("secv2.out");
int v[50005],minn[5005], maxx=0, I,J;
int main()
{
int n, k;
cin >> n >> k;
for(int i=1;i<=n;i++) {
cin >> v[i];
}
for(int i=1;i<=n;i++) {
v[i]+=v[i-1];
}
for(int i=1;i<=n;i++) {
minn[i]=min(minn[i-1],v[i]);
}
cout << 1;
for(int i=k;i<=n;i++) {
if(v[i]-minn[i-k+1]>maxx) {
I=i;
J=i-k;
}
}
cout << J << I << maxx;
return 0;
}
