wspl09876

送分题

用暴力，枚举一个修改的，算最大子段和，o(n)2的复杂度12345678910111213141516171819202122232425262728293031#include<cstdio>#include<iostream>using namespace std;int a[99999];int s;int n,p; int main(){ freopen( …