一个简单分段求和的问题
示例通过了但又数据没通过
想问问有没有解决办法
感谢
#include
#include
using namespace std;
int main()
{
int T;
cin >> T;
for (; T > 0; T--) {
int N, M, a[100000] = { '\0' }, n = 0, sum = 0;
char c[100000];
cin >> N >> M;
c[0] = getchar();
c[0] = getchar();
char std = c[0];
for (int i = 1; i < N; i++) {
c[i] = getchar();
if (std == c[i]) a[n]++;
else {
n++;
std = c[i];
}
}
for (int i = 0; i <= n; i++)
a[i]++;
sort(a, a + n + 1);
for (int i = M; i > 0; i--) {
sum += a[n - M + i];
}
cout << sum << endl;
}
return 0;
}
该回答引用ChatGPT
可参考下面的代码,如果可行,还请点击 采纳,感谢!
#include<iostream>
#include<string>
using namespace std;
int main(){
int T;
cin >> T;
while (T--){
int n, m;
cin >> n >> m;
string portals;
cin >> portals;
// Your code here
int result = 0;
// Your code here
cout << result << endl;
}
return 0;
}
```c++
```