哪个大佬能帮弟弟看看，哪里有错
#include<iostream>
#include<cstring>
using namespace std;
const unsigned int M = 1000;
int tower[M];
int main()
{
memset(tower,0,sizeof(tower));
int n;
// while(cin>>n)
// {
cin>>n;
memset(tower,0,sizeof(tower));
for(int i = 1 ;i <= n;i++)
{
cin>>tower[i];
}
int m;
cin >> m;
for(int j = 1 ;j <= m ;j++)
{
int a,b,c;
cin>>a>>b>>c;
if(1<= a&&a<=b&&b<=n)
if(a == b){
tower[a]+=c;
// tower[b]+=c;
}
else
{
tower[a]+=c;
tower[b]+=c;
}
}
for(int k = 1 ;k <= n;k++)
{
if(k == n) cout<<tower[k]<<endl;
else cout<<tower[k]<<' ';
}
return 0;
}
#include<cstring>
using namespace std;
const unsigned int M = 1000;
int tower[M];
int main()
{
memset(tower,0,sizeof(tower));
int n;
// while(cin>>n)
// {
cin>>n;
memset(tower,0,sizeof(tower));
for(int i = 1 ;i <= n;i++)
{
cin>>tower[i];
}
int m;
cin >> m;
for(int j = 1 ;j <= m ;j++)
{
int a,b,c;
cin>>a>>b>>c;
if(1<= a&&a<=b&&b<=n)
if(a == b){
tower[a]+=c;
// tower[b]+=c;
}
else
{
tower[a]+=c;
tower[b]+=c;
}
}
for(int k = 1 ;k <= n;k++)
{
if(k == n) cout<<tower[k]<<endl;
else cout<<tower[k]<<' ';
}
return 0;
}
查看25道真题和解析
